Open addressing. Consider a double hashing open addressing scheme with hash functions

h₁(k) = k mod 17 if (k mod 17) >0 and = 17 if (k mod 17) = 0; and

h₂(k) = k mod 5, except that if k(mod 5) = 0, h₂(k) = 5.

Assume the memory into which the keys are hashed has size 17 with addresses 1, 2, ,17.

In succession, insert the following keys in this memory via this hashing scheme. Display what is in the memory after each step of that process.

Keys to be hashed in this order.

k= 54;

k= 73;

k=139;

k = 107;

k=122