For Exercises 42-45, use the following values: 66, 47, 87, 90, 126, 140, 145, 153, 177, 285, 393, 395, 467, 566, 620, 735 Store the values into a hash table with 20 positions, using the division method of hashing and the linear probing method of resolving collisions. Store the values into a hash table with 20 positions, using rehashing as the method of collision resolution. Use key % tableSize as the hash function, and (key + 3) % tableSize as the rehash function. Store the values into a hash table with 10 buckets, each containing three slots. If a bucket is full, use the next (sequential) bucket that contains a free slot. Store the values into a hash table that uses the hash function key % 10 to determine which of 10 chains to put the value into