5. Say that we use a perfectly random hash Function to hash 11 objects into a hmh table of size 71. To bound the worst-ewe time to search for an element as DUE}, we'd like no entry in the table to have more than 3: objects map to it. Prove that the probability that there is a place in the table with k or more objects mapping to it is at most \"rie! (Hint: Look at the probability that any xed set of exactly 3: objects map to the same place in the table. Then use a union bound over all ways to choose the set of k objects and Use the fact that (3;)