$($use Java$)$

$(25$ Points$)$ Explore the Hash Table:

Add to your code routines that answer these questions. Some answers may not

be unique. You may resolve these issues by presenting either any correct answer

or all correct answers.

a$.$ How many non$-$empty addresses are there in the table? What does that make

the load factor, $,$ for our table?

b$.$ What is the longest empty area in the table, and where is it$?$

c$.$ What is the longest $($largest$)$ cluster in the table, and where is it$?$

Note: It might wrap from the end of the table back to the beginning.

d$.$ What hash value results from the greatest number of distinct words, and how

many words have that hash value?

e$.$ What word is placed in the table farthest from its actual hash value, and

how far away is it from its actual hash value?