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) mod 11 assuming collisions are handled by chaining. Secondly, show the result if collisions are handled by linear probing