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) chaining. (b) linear probing. (c) quadratic probing (up to the point where the method fails); Note that quadratic probing uses (h(k) + j2) mod N, for j = 1, 2, . . . ,N 1, instead when collisions occur. Please refer to the textbook on p358 and 359. (d) double hashing using the secondary hash function h(k) = 7(k mod 7). Note that double hashing uses (h(k)+jh(k)) mod N, for j = 1, 2, . . . ,N1, when collisions occurs.