create a hash table to implement spell checker in java

1. Create a file of 100 words of varying length (max 8 characters).

2. All the words are in lower case.

3. design a hash table.

4. enter each word in the hash table.

Once the hash table is created, run it as a spell checker.enter a word (interactive), find the word in the hash table. If not found enter an error message. Then prompt for next word. End the session by some control character ctrl-c.

1. use the linear probing first. Count the number of collisions and print it.

2. Then use quadratic probing. Count the number of collisions and print it.

3. Start with a table size that is about 53. So 100 words would still have a load factor of less than .5 Now add 10 more words. The program should automatically determine that table size needs to increase.

Print out - increasing table size to

rehash all the old words also and the new words to the new hash table.

Print the collisions in each case for the new table size.