Thumb up for the solution, thx!

4) Stacks and Queues, and Linked Lists (10 marks) a) Starting with an empty stack S, we do the following operations in order: PUSH(S,a), PUSH(S,b), POP(S), PUSH(S,c), PUSH(S,d), POP(S), PUSH(S,e) Show the resulting stack at the end. Draw the stack top-down (assume pop from the top) b) Starting with an empty queue Q, we do the following operations in order: ENQUEUE(Q,a), ENQUEUE(,b DEQUEUE(Q), ENQUEUE(Q,c), ENQUEUE(Q,d), DEQUEUE(Q) ENQUEUE (Q,e). Show the resulting queue at the end, Draw the queue with the front of the queue on the left. c) A queue Q is implement with an array A[1..5], after several operations, the array A is 2 345 Also, Q.head Q.tail -5, at this point, what is the result of DEQUEUE)? d) Fill in the missing statements (i) and (ii) in the following implementation of a queue Q using two stacks S1 and S2: Insert(Q, x)i push (S1, x); Delete(Q) if(stack-empty(S2)) then if(stack-empty(S1)) then { print("Q is empty"); return else while stack S1 is not empty { x-pop(S2)