4. (15 pts) Draw the 11-entry hash table that results from using the hash function h(i) = (2i +5) mod 11, to hash the keys 34, 22, 2, 88, 23, 72, 11, 39, 20, 16, and 5, assuming collisions are handled by the following approaches respectively (a) (5 pts) chaining (b) (5 pts) linear probing (c) (5 pts) double hashing h'(k-7-(k mod 7)