Do the same as in Exercise 11.4 but for a hash table of size 2031 that contains 999 keys.
Exercise 11.4:
Consider a hash table of size 501 that contains 85 keys.
(a) What is the load factor?
(b) What is the average number of comparisons required to determine if the collection contains the key 73, if:
i. linear probing is used
ii. quadratic probing is used
iii. separate chaining is used