(a) Draw the 11-item hash table resulting from hashing the keys 12,44,13,88,23,94,11,39,20,16, and 5 , using the hash function h(i)=(2i+5)mod11 and assuming collisions are handled by chaining. (a) Show the result of Exercise 6.6.1, assuming collisions are handled by quadratic probing, up to the point where the method fails because no empty slot is found