(Solved) : Consider Problem Inserting Keys 10 22 31 4 15 28 17 88 59 Hash Table Length 11 Tablesize 1 Q35631295 . . . .

Consider the problem of inserting the keys 10, 22, 31, 4, 15,28, 17, 88, and 59 into a hash table of length 11 (TableSize = 11)using open addressing with the standard hash function h(k) = k modTableSize. Illustrate the result of inserting these keys using:

(a) Linear probing.

(b) Quadratic probing with quadratic probe function c(i) =(3i^2) + i.

(c) Double hashing with u(k) = k and v(k) = 1 + (k mod(TableSize − 1)).

Important Notes:

• For this problem, you don’t need to submit any implementationin Java.

• You must justify your results and draw the hash tables usingthe appropriate graphics tools at your