Suppose that your hash function resolves collisions using open addressing with double hashing,

which we discussed in class. The double hashing method uses two hash functions h and $h^{\text{'}}.$ Assume

that the table size $N=13,h(k)=$kmod$13,h^{\text{'}}(k)=1+(kmod11),$ and the current content of the

hash table is:

If you insert $k=16$ to this hash table, where will it be placed in the hash table? You must describe,

step by step, how the location of the key is determined.