Problem
1. Draw a diagram similar to that of Figure 4.16 showing levels of refinement for a stack.
2. Give a formal definition of the term deque, using the definitions given for stack and queue as models. Recall that entries may be added to or deleted from either end of a deque, but nowhere except at its ends.
