Create a data set with 100 integer values. Create a program that uses the division method of hashing to store the data values into hash tables with table sizes of 7,,51 and 151. Use the linear probing method of collision resolution. Print out the tables after the data values have been stored. Search for 10 different values in each of the three hash tables, counting the number of comparisions necessary. Print out the number of comparisions necessary in each case in tabular form. Turn in a listing of your program and a listing of the output.

Deliverables:

1. A word file containing description of the program, screen shots of test runs.

2. The file with java code (the .java file)