Implement a function that reverses a list of elements by pushing them onto a stack in one order, and writing them back to the list in reversed order.

 R-6.6 Give a precise and complete definition of the concept of matching for grouping symbols in an arithmetic expression. Your definition may be recursive.

 R-6.10 Consider what happens if the loop in the ArrayQueue. resize method at lines 53–55 of Code Fragment 6.7 had been implemented as: for k in range(self. size): self. data[k] = old[k] # rather than old[walk] Give a clear explanation of what could go wrong. 

R-6.11 Give a simple adapter that implements our queue ADT while using a collections.deque instance for storage.

R-6.12 What values are returned during the following sequence of deque ADT operations, on initially empty deque? add first(4), add last(8), add last(9), add first(5), back( ), delete first( ), delete last( ), add last(7), first( ), last( ), add last(6), delete first( ), delete first( ).

R-6.13 Suppose you have a deque D containing the numbers (1,2,3,4,5,6,7,8), in this order. Suppose further that you have an initially empty queue Q. Give a code fragment that uses only D and Q (and no other variables) and results in D storing the elements in the order (1,2,3,5,4,6,7,8).

 R-6.14 Repeat the previous problem using the deque D and an initially empty stack S.