Consider the following sequence of stack operations: push(9), push(4), pop(), push(6), push(3), pop(), pop(), push(5). (a) Assume the stack is initially empty, what is the sequence of popped values, and what is the final state of the stack? (Identify which end is the top of the stack). (b) Suppose you were to replace the push and pop operations with enqueue and dequeue respectively. What would be the sequence of dequeued values, and what would be the final state of the queue? (Identify which end is the front of the queue). (c) Suppose you have to replace the priority queue with simple queue. What would be the sequence of dequeued values, and what would be the final state of the queue? (Identify which end is the front of the queue). (d) Suppose you have replaced the simple queue with circular queue and size of queue is 4. If initially the front and rear are both at index-2 having value 0. Where will the front and rear after applying above mentioned operations