Question $7.$ Let $H$ be a hash table of size $9$ with the hash function $h(k,i)=(5k+2j)mod9$ implemented using OPEN ADDRESS HASHING. $($Note that even though $9$ is not prime, this hash function visit every hash table location once as $j$ goes from $0$ to $8.)$

Assume that $H(3),H(5),H(6),$ and $H(7)$ are already filled in the hash table so that the hash table looks as follow

$\backslash$table$[[0,1,2,3,4,5,6,7],[,,,(15,D_{15}),,(6,D_6),(3,D_3),(5,D_5)$