Kindly note that this is a general data structures and algorithm question which does not require solution in any specific programming language. The solution must be presented in PSEUDO-CODE only without using language specific functions.

3. (a) Given an empty stack, execute the following sequence of operations: push7), push(8), push(9), pop0, pop0, push(10) What is the contentof the stack after these operations have been performed? In your answer you should give thc clements remaining in the stack in order, starting from the top of the stack (2 marks) (b) Given an empty queue, execute the following sequence of operations enqueue(7), enqueue(8), enqueue(9), dequeue0, dequeue0, enqueue(10) What is the content of the queue after these operations have been performed? In your answer you should give the elements remaining in the queue in order, (2 marks) (c) Give pseudocode for an algorithm that copies all the elements from a stack A to an initially empty stack B so that the elements appear in stack B in the same order as they were originally in A. Assume that all the elements of A are integer numbers. You are allowed to usc one additional stack C and no other starting from the front of the queuc. data collcctions (7 marks) (d) Repeat the task of part (c) with the additional condition that you are not (You are free to use an arbitrary number of integer variables) allowed to use any data collection except A and B Hint: Write a recursive procedure that removes the fi element from A, saves it in an integer variable and then performs this task recursively on the rest of (7 marks) (e) Demonstrate the correctness of your solution for part (d) by providing a detailed (2 marks) the stack run on a stack of 3 elements