Problem
1. Describe how to implement successors(k) in an ordered dictionary realized using an ordered search table. What is its running time?
2. Repeat the previous exercise using a skip list. What is the expected running time in this case?
3. Design a Java class that implements the skip list data structure. Use this class to create implementations of both the map and dictionary ADTs, including location-aware methods for the dictionary.