Problem
Use the methods for stacks and queues developed in the text to write functions that will do each of the following tasks. In writing each function, be sure to check for empty and full structures as appropriate. Your functions may declare other, local structures as needed.
(a) Move all the entries from a Stack into a Queue.
(b) Move all the entries from a Queue onto a Stack.
(c) Empty one Stack onto the top of another Stack in such a way that the entries that were in the first Stack keep the same relative order.
(d) Empty one Stack onto the top of another Stack in such a way that the entries that were in the first Stack are in the reverse of their original order.
(e) Use a local Stack to reverse the order of all the entries in a Queue.
(f) Use a local Queue to reverse the order of all the entries in a Stack.