R-8.4 Draw the 11-item hash table that results from using the hash function
to hash the keys 12, 44, 13, 88, 23, 94, 11, 39, 20, 16 and 5, assuming collisions are handled by chaining.
R-8.5 What is the result of the previous exercise, assuming collisions are handled by linear probing?
R-8.7 What is the result of Exercise R-8.4 assuming collisions are handled by double hashing, using the secondary hash function