Problem
1. Give a pseudo-code description of the remove operation in a skip list.
2. Argue why location-aware entries are not really needed for a dictionary implemented with a good hash table.
3. Given a collection C of n cost-performance pairs (c,p), describe an algorithm for finding the maxima pairs of C in O(n logn) time.