• Add to the LinearProbingHashST class the following methods in a java program:
  • one named sameValueCount(V value) that count and print how many words occur once and then again how many words occur 6 times.
  • one named clusterCount() that computes and returns a count of the number of clusters in the hash table;
  • one named maxClusterSize() that computes and returns the size of the largest cluster in the hash table;
• Add to the SeparateChainingHashST class the following methods:
  • one named sameValueCount(V value) that count and print how many words occur once and then again how many words occur 6 times.
  • one named chainCount that computes and returns a count of the number of chains (linked lists) in the hash table;
  • one named maxChainSize() that computes and returns the size of the largest chain in the hash table;

Test these changes by writing an application program called Test.java that creates two hash tables, one of each type of those above. For both hash table, print the number of unique words, the number of words that occur exactly six times, the number of clusters and chains, and the size of the maximum chain and cluster