Consider a double hashing scheme in which the primary hash function is:

h₁(k) = k mod  13  

and the secondary hash function is:

h₂(k) = 1+(k mod  5)

Assume that the table size is 13.

Find the address returned by probe 2 in the probe sequence for the key value k=20. Assume that the probe sequence begins at probe 0.

Suppose you inserted the keys 1, 3, 4, 7, 12, 14, 16, 17, 30, 39 (exactly in this order) into a hash table of size 13 using the hash function:

h(x)=(3x+5) mod  13 also insert key 27 and 43 after that

using chaining for collision resolution.