Using hash table performance formulas given in the chapter, compute the average number of comparisons necessary when the tabe is: a. 10% full

b. 25% full

c. 50% full

d. 75% full

e. 90% full

f. 99% full

at what point do you think the hash table is too small? explain.

Equations:

Successful = (1+(1/1-))

Unsuccessful = (1+(1/1-)²))