Hashing with chaining

(a) Consider a hash table with m slots that uses chaining for collision resolution. The table is initially empty. What is the probability that, after k keys are inserted, there is a chain of size k? Include an argument for or proof of your solution.

(b) Show the table that results when 9, 32, 1, 66, 40, 20, 51, 10 are cumulatively inserted in that order into an initially empty hash table of size 11 with chaining and h(k) = k mod 11. Draw this with a vertical table indexed from 0 to 10, and linked lists going off to the right, as shown in the template below

012-3456789