Create a data set with 100 integer values. Use the division method of hashing to store the data values into hash tables with the initial table sizes of 7, 51, and 151. (if it is necessary, you may need to double the table size.) 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 comparisons necessary. Print out the number of comparisons necessary in each case, in tabular form.