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:

Suppose you are an ad-serving company and you maintain a log of cookie data for ads you serve to the web pages for a particular vendor (say amazon). a. how can you use this data to determine which are the best ads? b. how can you use this data to determine which are the best ad formats? c. how could you records of past ads and ad clicks to determine which ads to send to a given ip address? d. how could you use this data to determine how well the technique you used in your answer to part c was working? e. how could you use this data to determine that a given ip address is used by more than one person? f. how does having this data give you a competitive advantage vis-à-vis other ad-serving companies?