For Exercises $19-22,$ use the following values:

$66478790126140145153177285393395467566620735$

$19).$ store the values in a hash with $20$ positions, using the division method of hashing and linear probing method of resolving collisions. $20).$ store the values In a hash table with $20$ positions, using rehashing as the method of collision resolution. Use key $\backslash \%$tableSize as the hash function and $($key $+3)\backslash \%$ tableSize as the rehash function. $21).$ store the values in a hash table with ten buckets, each containing three slots. If a bucket is full, use the next $($sequential$)$ bucket that contains a free slot. $22).$ store the values in a hash table that uses the hash function key $\backslash (\backslash \%10\backslash )$ to determine into which of ten chains to put the values.