o Assume an 11 entry hash table o Use the hash function h(i)-2i + 5 mod 11 Insert the keys: 12, 44, 13, 88, 23, 94, 11, 39, 20, 16, 5 o Draw the contents of the hash table given that for collisions: . Chaining is used Linear Probing is used Quadratic Probing is used Double Hashing is used with h'(k) -7- (k mod 7)