Data Structure Class

Please don't copy others answer from chegg and answer it. I will rate your answer very good.

1. Algorithm and Running Time Analysis: Give the tightest possible upper bound for the worst case running time for each of the following in terms of N. Assume that the most time-efficient implementation is used. Pushing a value onto a stack containing N values, implemented as a linked list Explanation: a. b. Pushing a value onto a stack implemented as an array. Assume the array is of size 2N Explanation: Enqueue a value onto a queue containing N values implemented as a circular array (as described in class). (Assume the array is size N+5 Explanation c. d. Pop a value off a stack containing N elements implemented as an array. Explanation e. Popping a value in a stack implemented as linked list. Be specific in explaining how you get the runtime you provide. Explanation: f. Given a FIFO queue implemented as a linked list, find and remove all of the values greater than 10, leaving the rest of the queue in its original order. Explanation: Given a FIFO queue implemented as a linked list currently containing N values, enqueue N more values so that when you are finished the queue will contain 2N values (Give the total time for enqueueing N more values). Explanation: g. h. Finding something in a sorted array? Explanation: i. Finding and removing all values greater than 12 from a stack implemented with a linkedlist (leaving the rest of the stack in its original order)? Explanation