I. Fillin $(4$ questions in total; $60\mathrm{.}0$ points$)$

$5\mathrm{.}0$ Consider an open addressing hash table with $5$ slots. For the hash function $h(x)=x$ mod $5.$ Insert the keys

$\{8,16,5,7,20\}($in the order given$)$ into the table. Use linear probing for collision resolution$($Probe

sequence di is $1,2,$dotsdots,$m-1,m$ is the length of hash table$).$ Show the result in the table below.