Question 1.
What is the worst-case running time for inserting n key-value entries into an initially empty map M that is implemented with a list?
Question 2.
Draw the 11-entry hash table that results from using the hash function, h(i) = (2i + 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 3.
What is the result of the previous exercise, assuming collisions are handled by linear probing?
Question 4.
What is the result of Question 2 when collisions are handled by double hashing using the secondary hash function h'(k) = 7 - (k mod 7)?