Java: Implement a hash table with seperate chaining and find the most frequent string

The hash value function is given by "Hash value ( hashcode )-( hashcode(key) ) % capacity of hash table" which you will use to access the hash table. The % symbol serves as modulus operator and the size of the hash table is the total number of entries in the table. The hash value is computed as following hashcode 0 for j-0 to LengthOfTheKey-1 hashcode: (37 * hashcode + key.charAt( j )) % capacity of hash table; You can assume all the values are integers and all the inputs(keys) are strings with a newline character delimiter as well as containing uppercase/lowercase characters. The initial size of the hash table will be a given with a prime number. If the hash table reach/ exceeds 75%of its capacity, you need to invoke the function called rehash() After every insertion, you ought to check if the hash table needs to be rehashed (if this is the case, the new size has to be greater (twice as large as) than the previous size and it has to be a prime number. Keep in mind that you have to rehash all the keys before storing it in the resized table Next you will use the function called "mostFrequentString" and the "Pair class" to find the frequency of each string and return an array of the five most frequent strings. As mentioned before, strings will consist of upper/lowercase and with a newline character delimiter