Implement Double hashing for the below given list:

r$.$ Table Size $15$

Insert $16,7,28,31,67,28,29,73,99,43,218>$ kmod $15$

$>7-$kmod$7$

Given the input $\{42,39,57,3,18,5,67,13,70,26\},$ and a fixed

table size of $13,$ and a hash$-$function $H(x)=x$ mod $13,$ show

the resulting

$-1.$Linear probing hash$-$table $($Circle the elements which causes collision$)$

$>2.$ Separate chaining hash$-$table