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. Illustrate the result of inserting these keys using the following three commonly used techniques to compute the probe sequences.
a. linear probing
b. quadratic probing with c1 = 1 and c2 = 3
c. double hashing with h1(k) = k and h2(k) = 1 + (k mod (m – 1))
You must show your work. Simply stating the answers will result in 0 points awarded.
