Draw the 11-entry hash table that results from using the hash function, h(i)=(3i+5) mode 11, to hash the keys 12, 44, 13, 88, 23, 94, 11, 39, 20, 16, and 5, assuming collisions are handled by chaining, linear probing, and finally quadratic probing, up to the point where the method fails.