Problem
1. Give a pseudo-code description for an array-based implementation of the double-ended queue ADT. What is the running time for each operation?
2. Describe how to implement the stack ADT using two queues. What is the running time of the push() and pop() methods in this case?