Question 1. Draw the 11-entry hash table that results from using the hash function, h(k) = (2k + 5) mod 11, to hash the keys 12,44, 13, 88, 23, 94, 11, 39, 20, 16, and 5, assuming collisions are handled by chaining.
Question 2.
What is the result of the previous exercise,
assuming collisions are handled by linear probing?
Question 3.
What is the result of Exercise R-9.5
when collisions are handled by double hashing
using the secondary hash function h(k) = 7 - (k mod 7)?