Consider a hash table of size 501 that contains 85 keys.

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

(c) Explain why the table size must be a prime number in order for double hashing to visit every entry during the probe.

Thanks!