Problem
1. Describe an implementation of the methods addLast and add Before realized by using only methods in the set {isEmpty, checkPosition, first, last, prev, next, addAfter, addFirst}.
2. Let L be maintained to be a list of n items ordered by decreasing access count. Describe a series of O(n 2 ) accesses that will reverse L.