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 mod TableSize. Illustrate the result of inserting these keys using:

(a) Linear probing.

(b) Quadratic probing with quadratic probe function

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