3. Consider a 11-entry hash table which uses the hash function, h(i) = (5i + 3) mod 11, to hash the keys 10, 22, 61, 33, 15, 44, 27, 19, 71, 54, and 5. Please draw the resulting hash table using each one of the following strategies to handle collisions.

   (a) chaining (b) linear probing

   (c) double hashing using the secondary hash function h(k) = 11 (k mod 7)

3. (20 pts) Consider a 11-entry hash table which uses the hash function, h(i) (5i + 3) mod 11, to hash the keys 10, 22, 61, 33, 15, 44, 27, 19, 71, 54, and 5. Please draw the resulting hash table using each one of the following strategies to handle collisions. (a) chaining (b) linear probing (c) double hashing using the secondary hash function h'(k) = 11 (k mod 7)