Write code in Java.
Create a dictionary text file and make a hash table that istwice as large as the dictionary, and apply the hash functiondescribed in the text to each word, and store a count of the numberof times each position is hashed to. You will get a distribution:Some percentage of the positions will not be hashed to, some willbe hashed to once, some twice, and so on. Compare this distributionwith what would occur for theoretical random numbers.
Solution