$(8$ points$)$ Suppose you want to store the numbers: $36,17,74,83,61,99$ in array using the following hash function and collision resolution policy: for each data value $x$

Compute $i=$xmod$6$

Store $x$ in $A[i]$ if non$-$occupied.

If $A[i]$ already has a value stored, store in next available location, wrapping around if necessary.

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

$(8$ points$)$ Suppose you want to store the numbers: $36,17,74,83,61,99$ in array using the following hash function and collision resolution policy: for each data value $x$

Compute $i=$xmod$6$

Store $x$ in $A[i]$ if non$-$occupied.

If $A[i]$ already has a value stored, store in next available location, wrapping around if necessary.

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