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.

Popping a value in a stack implemented as linked list. Be specific in explaining how you get the runtime you provide. Explanation e. 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 goqueueing 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