Problem
Describe how to modify the skip list data structure to support the method atIndex(i), which returns the position of the element in the "bottom" list S0 at index i, for i ∈ [0, n - 1]. Show that your implementation of this method runs in O(logn) expected time.