Algorithms anlayis class only need problem number 2 help.

Problem 1. A queue datastructure Q can be implemented using two stacks S1 and S2 as follows: ENQUEUE Q, x) PUSH (Q.S1, x) DEQUEUEQ IF EMPTY (Q.S2) WHILE NOT EMPTY(Q.S) x = POP(Q.SI) PUSH Q S2, x) RETURN POP(Q.S2) Suppose we perform a sequence of n ENQUEUE and DEQUEUE operations on an initially empty queueq using this implementation (you can assume that DEQUEUE is never called when the queue is empty). Derive a "naive" bound on the overall number of PUSH and POP operations performed. Use aggregate analysis to derive the average number of PUSH and/or POP operations per queue operation. Problem 2. Analyze the same problem as in problem 1, but with the accounting method. Argue indepen- dently of problem 1 why the assigned costs are enough to ensure that there is always sufficient credit