Please carefully explain how to get the answer, thanks !

(1) (10 pts) Suppose that we are storing a set of n keys into a hash table of size m. Show that if the keys are drawn from a universe U with |U] > nm, then U has a subset of size n consisting of keys that all hash to the same slot, so that the worst-case searching time for hashing with chaining is (n) (2) What are the minimum and maximum numbers of elements in a heap of height h