Corollary 11.7 (page 276) says that the expected number of probes to insert an element into a hash table with m slots, n of which are filled, is at most P_n = 1/1 - n/m, assuming uniform hashing and open addressing. Use this bound to find an upper bound on the number of probes required to fill up an empty hash table. That is, compute sigma_n = 0^m - 1 P_n and give a closed-form formula. Compare your answer to the claim of Problem 11-1(d) in CLRS