a. (15 points) Store the key values in a hash table (given below) of size 20 locations (indexed 1 .. 20) using division hashing method and linear probing for collision resolution. Use the table below to store the hashed values. Use the space below as work area.

b. ) Complete the following table showing the number of comparisons needed to find each value using the hash function used in part (a) above.

4 (25 points): Consider the following key values: 66 47 87 90 126 140 145 153 177 285 393 395 467 566 620 735 a) (15 points) Store the key values in a hash table (given below) of size 20 locations (indexed Iw 20) using division hashing method and linear probing for collision resolution. Use the table below to store the hashed values. Use the space below as work area. Index 2345 6 7 8910 12 13 1415 16 17 18 19 20 Key b) (10 points) Complete the following table showing the number of comparisons needed to find each value using the hash function used in part (a) above. Value # of comparisons 467 566 735 285 87