You are given an empty hash table of size $7$ that uses open addressing. The following sequence of keys is to be inserted:

$15,17,8,23,3,5$

Insert these keys using each of the following approaches. If overflow occurs, and indicate the element that causes the overflow.

$h(x)=x\%7$; linear probing

$h(x)=x\%7$; quadratic probing

$\backslash$table$[[0,],[1,],[2,],[3,],[4,],[5,],[,]]$

$h(x)=x\%7$; double hashing with $h2(x)=\frac{x}{7}+1($using integer division$)$

$lon$