1.  Prove that in the CP algorithm, at any time, there are
at most 4 input points in any cell of the current grid.

2.  Let s_1 ... s_n be the set of input points after random permutation
in the CP algorithm.  Define S_i = {s_1 ... s_i}.  Denote by p_i 
the probability that
the closest pair of S_{i+1} must contain s_{i+1}.  Show that p_i <= 2/(i+1).

3.  Explain how to implement a grid data structure in O(log n)
time for each lookup and each insertion, where n is the maximum number
of items in the structure at any given time.
