Before you start working on this assignment you must know how linear probing, quadratic probing, and double hashing work. If you need assistance, view the optional videos to learn more about these techniques.

Consider inserting the keys 10, 22, 31, 4, 15, 28, 17, 88, 59 into a hash table of length m=11 by using the division method and open addressing with the auxiliary hash function h^' (k)=k.

Using a word document, or a drawing document of your choice, Illustrate (draw) the result of inserting these keys using linear probing, using quadratic probing with c=1, and c2 = 3, and using double hashing with h_1 (k)=k and h_2 (k)=1+ k. Submit your results for assessment.