Hash Tables: Please show work/explain.

(c) (4 points) Suppose you have a hash table where the load-factor is related to the number n of elements in the table by the following formula: =1logn1. If you resolve collisions by chaining, what is the expected time for an unsuccessful search in terms of n ? (d) (4 points) Using the same formula relating and n from part (c), if you resolve collisions by open-addressing, give a good upper bound on the expected time for an unsuccessful search in terms of n. For this part, assume Uniform Hashing