This homework is about hash tables. Its implementation can be used as part of the programming project.

[50 points] Write a Java program that implements a chained hash table for strings. You may use the integer hash table from lab as a template. Your table should provide methods for insert, delete, and search. Make sure to design a hash function appropriate for strings; the one described in lecture will get you started.

After your hash table is operating properly, extend your implementation to make the table adjustable. That is, when the load factor of the current table T reaches a threshold K a new table T' should be created that is twice the size of T. The elements of T should then be inserted into the new table T'. T may then be discarded and T' becomes the current table. You may want to provide a table constructor that sets the initial table size and the threshold K:

public StringHashTable(int initialSize, double maxLoadFactor)

Test your hash table with enough distinct strings to indicate that the resizing works correctly.

Hand in: code and scripts for your adjustable chained hash table for strings.
Be sure to include documentary comments in your code.
instructions on how to submit