Write a hash table in which both the keys and the values are of type String . (NOT generic programming OR a generic class.) Write an implementation of hash tables from scratch. Define the following...

Write a hash table in which both the keys and the values are of type
String. (NOT generic programming OR  a generic class.)

Write an implementation of hash tables from scratch.

Define the following methods: get(key), put(key,value), remove(key), containsKey(key), and size(). Remember that every object, obj, has a method obj.hashCode() that can be used for computing a hash code for the object, so at least you don't have to define your own hash function.

**//Do not use any of Java's built-in generic types; create your own linked lists using nodes as covered in section 9.2.2 of Eck, D. J. (2019). Introduction to programming using Java, version 8.1. Hobart and William Smith Colleges. http://math.hws.edu/javanotes

However, you do not have to worry about increasing the size of the table when it becomes too full.


You should also write a short program to test your solution.