Consider inserting the keys 10, 22, 31, 4, 15, 28, 17,88,59 into a hash table of length m = 11 using open addressing with the auxiliary hash function h'(k) = k. What are the results using a) linear probing; b)quadratic probing with c=1 and d' = 3; c) double hashing with hi(k) = k and h2(k) = 1+ (k mod (m 1))