Find yourself a large online dictionary. Choose a table sizethat is twice as large as the dictionary. 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 (discussed inSection 9.3). Need help breaking this down and coding it inJava.
Answer