Fill in the following worst-case big O execution times for the dynamic array stack/queue/deque (with upsizing strategy only) and the doubly linked list (with both front and back sentinels) stack/queue/deque operations. Format your answers as O(1), O(N), O(logN), O(N^2), etc. Provide your answer in the Canvas textbox. Dynamic Array Push: Pop: Enqueue: Dequeue: Add_front: /Add_back: Remove_front: /Remove_back: Linked List Push: Pop: Enqueue: Dequeue: Add_front: / Add_back: Remove_front: /Remove_back:

Write a program that has a conversation with the user. the program must ask for both strings and numbers as input. the program must ask for at least 4 different inputs from the user. the program must reuse at least 3 inputs in what it displays on the screen. the program must perform some form of arithmetic operation on the numbers the user inputs. turn in your .py file as well as a screenshot of your program's output. include comments in your code to explain how it works an example program run might look like (have fun with this and be creative): ‘what is your name? ’ “josh” ‘, josh. what is your favorite color? ’ “green” ‘mine too. do you also like ice cream? ’ “no” ‘josh, how old are you? ’ “40” ‘ and how many siblings do you have? ’’ “3” ‘that means you are one of 4 kid(s). is green the favorite color of anyone else in your house? ’