Problem
1. Let L be a list of n items maintained according to the move-tofront heuristic. Describe a series of O(n) accesses that will reverse L.
2. Show that, using an extendable array that grows and shrinks as described in the previous exercise, the following series of 2n operations takes O(n) time: (i) n push operations on an array list with initial capacity N = 1; (ii) n pop (removal of the last element) operations.