1) Build a data set with the 100 integer values. Utilize the division method of hashing in order to store the data values into the hash tables with initial table sizes of 7, 51, and 151. (if it is essential, you may require to double the table size.) Utilize the linear probing method of the collision resolution. Print out the tables after the data values have been stored.
Search for ten several values in each of the three hash tables, counting the number of comparisons essential. Print out the number of the comparisons essential in each case, in tabular form.