$($Java$)$

$(20$ Points$)$ Create a Hash Table using Closed Hashing $($Open Addressing$)$:

a$.$ Build a hash table of size n$,$ i$.$e$.$ entries from $0$ to n $1,$ from the hash values computed in Part $1$ above. You should have the user enter the size of the table to be created, i$.$ e$.$ n$.$ Load the words into the table in the order they occur in the file, discarding duplicates. Some of our tables might get close to full, but you needn$$t worry about re$-$sizing them$$we will examine the effects of their load factors in Part $3$ below.

b$.$ Display the table, starting with table entry $0,$ in lines of the form:

Hash Address, Hashed Word, Hash Value of Word

$($Remember$,$ the Hash Address will not match the Hash Value when the resolution of a collision forces a word to be cascaded down the table. Also, remember that the table should be thought of as a circular list so that a word which cascades past the bottom end of the table gets wrapped to the top in looking for an open place in the table.$)$

Note: Your program may perform Parts $1$ & $2$ simultaneously, if you wish.