3. Consider inserting the keys 11, 2, 31, 4, 69, 16, 16, 27, 22 from left to right into a hash table of length m =11 using open addressing with the auxiliary hash function hk)kmod m. Draw the hash tables after inserting these keys a) using inear probing whith h(k,i) - (h (k) i) mod m b) using quadratic probing withh(k,t) (h'(k) +c,+c)modm, where c, 1and c 3 c) using double hashing with h(k,)-(h (k) + ih2(k))modm whereh,(k)-1(kmod (m-1)), for i-0,1.. m-1 (Must show all the intermediate steps involving the hash value calculations.)