Could you solve c and d?

Problem 3. a) Describe the output of the following series of stack operations on a single, initially empty stack: push(5), push(3), pop), push(2), push(8), pop), push(9), push(1), pop), push(7) push(6), pop), pop), push(4), pop), pop). b) Describe the output of the following series of queue operations on a single, initially empty queue: enqueue(5), enqueue(3), dequeue), enqueue (2), enqueue(8), dequeue), enqueue(9), enqueue(1), dequeue(), enqueue(7), enqueue(6), dequeue, dequeue), enqueue(4) dequeue(), dequeue c) Describe in pseudo-code a linear-time algorithm for creating a copy stack S of a stack S. As the result, you must end up with two identical stacks S' and S. To access the stack, you are only allowed to use the methods of stack ADT d) Describe how to implement two stacks using one array. The total number of elements in both stacks is limited by the array length; all stack operations should run in O(1) time