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.

a) Pushing a value onto a stack containing N values, implemented as a LinkedList with or without tail:

Big-Oh:

Explanation:

b) Pushing a value onto a stack implemented as an array. Assume the array is of size 2N.

Big-Oh:

Explanation:

c) 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.)

Big-Oh:

Explanation:

d) Pop a value off a stack containing N elements implemented as an array.

Big-Oh:

Explanation:

e) . Popping a value off a stack implemented as LinkedList with or without tail. Be specific in explaining how you get the runtime you provide.

Big-Oh:

Explanation:

f) Given a FIFO queue implemented as a LinkedList with or without tail, find, and remove all the values greater than 10, leaving the rest of the queue in its original order.

Big-Oh:

Explanation:

g) Given a FIFO queue implemented as a LinkedList with or without tail 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)

Big-Oh:

Explanation:

h) Finding something in a sorted array?

Big-Oh:

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)?

Big-Oh:

Explanation: