Implement a hash table. The hash table will hold data items whose type is tuple. This class will have following public methods and constructor.
HashTable(int size) Finds the smallest prime integer p whose value is at least size. Creates a hash table of size p where each cell initially is NULL. It will determine the hash function to be used in the hash table by creating the object new HashFunction(p).
maxLoad() Returns the maximum load of the hash table
averageLoad() Returns the average load of the hash table
size() returns the current size of the hash table.
numElements() returns the number of Tuples that are currently stored in the hash table. loadFactor() return the load factor which is numElements()/size()
add(Tuple t) Adds the tuple t to the hashtable; places t in the list pointed by the cell h(t.getKey()) where h is the hash function that is being used. When the load factors becomes bigger than 0.7, then it (approximately) doubles the size of the hash table and rehashes all the elements (tuples) to the new hash table. The size of the new hash table must be: Smallest prime integer whose value is at least twice the current size.
search(int k) returns an array list of Tuples (in the hash table) whose key equals k. If no such Tuples exist, returns an empty list. Note that the type of this method must be ArrayList
remove(Tuple t) Removes the Tuple from the hash table