1. Suppose that some application requires using two stacks whose elements are of the same type. A natural storage structure of such a two-stack data type would consist of two arrays and two top pointers. Explain why this may not be a spacewise efficient implementation.

2. Using the basic queue and stack operationns, write an algorithm to reverse the elemens in a queue.

3. Assume that 'Stack' is the class described in this section with 'StackType' set to int and STACK_CAPACITY or myCapacity set to 5. Give the value of 'myTop' and the contents of the array referred to by 'myArray' in the Stack s afer the code segment is executed, or indicate why an error occurs.
Stack s;

s.push(10);
s.push(22);
s.push(37);
s.pop();
s.pop();