Consider inserting the keys 11, 23, 32, 5, 16, 27, 65 into a hash table of length m = 11 by using

1) Linear probingwhere h'(k) = k. Show your computations and the final result in a table.

2) Quadratic Probing where h'(k) = k. and c1 = 1, c2 = 3. Show your computations and the final result in a table.

3) Double Hashing where h1(k), h2(k) = 1 + (k mod (m-1)) Show your computations and the final result in a table.