1. Using the format of Table 15.2, complete a table that involves the following sequence of queue operations:
Label your answer columns using the following wording: State of the Queue After the Operation; Value Returned; and Comment.
2. Define a function named stackToQueue. This function expects a stack as an argument. The function builds and returns an instance of LinkedQueue that contains the elements in the stack. The function assumes that the stack has the interface described in Chapter 14. The function’s postconditions are that the stack is left in the same state as it was before the function was called, and that the queue’s front element is the one at the top of the stack.
