Given the following items to insert into a hash table of size $10,$ show the hash table after all items have been inserted.

$-$ The items are to be inserted starting from the top of the list and working down.

$-$ The primary hash function is key modulus table size.

$-$ The collision resolution strategy is quadratic probing.

$-$ While answering, first write index in the order of $\backslash (0,1,2\backslash$ldots $\backslash ),$ then write corresponding item and key for index. $\backslash$begin$\{$tabular$\}\{|$c$|$c$|$c$|\}$

$\backslash$hline Index & Item & Key $\backslash \backslash$

$\backslash$hline $0$ & & $\backslash \backslash$

$\backslash$hline $1$ & & $\backslash \backslash$

$\backslash$hline $2$ & & $\backslash \backslash$

$\backslash$hline $3$ & & $\backslash \backslash$

$\backslash$hline $4$ & & $\backslash \backslash$

$\backslash$hline $5$ & & $\backslash \backslash$

$\backslash$hline $6$ & & $\backslash \backslash$

$\backslash$hline $7$ & & $\backslash \backslash$

$\backslash$hline $8$ & & $\backslash \backslash$

$\backslash$hline $9$ & & $\backslash \backslash$

$\backslash$hline

$\backslash$end$\{$tabular$\}$