Answer the following question:

What are the best k hashes and m bits values to store one million n keys (E.g. e52f43cd2c23bb2e6296153748382764) suppose we >use the same MD5 hash key from pickle_hash.py and explain why?

reason: m = - (n * log(p)) / (log(2)^2) ; k = (m/n) * math.log(2)