Java hashing: Create a hash table for the following values:

I only need answers for 44.) and 45.) out of this problem set. Thanks.

10.6 Hashing For Exercises 42-45, use the following values: 66, 47, 87, 90, 126, 140, 145, 153, 177, 285, 393, 395, 467, 566, 620, 735 42. Store the values into a hash table with 20 positions, using the division method of hashing and the linear probing method of resolving collisions. 43. Store the values into a hash table with 20 positions, using rehashing as the method of collision resolution. Use key tables ize as the hash function, and (key 3) table size as the rehash function. 44. 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. 45. 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