Algorithm Problem: Hashing

Please include all the steps and details for learning purposes.

Given the keys 16, 11, 5, 37, 15, 33, 27, 4, 13 and a hash table of size 11

(3) (Double hashing) Insert the above keys using open addressing with hash function h{k, i) = (h1(k) +ih (k)) mod 11, where h1(k) = k and h2(k) = 1 + (k mod 11)