Suppose we want to store items $a,b,c,d,e,f,g,$ whose keys are:

a$.$key $=23$

b$.$key $=7$

c$.$key $=54$

d$.$ key$=21$

e$.$key $=12$

f$.$key $=42$

g$.$key $=39$

We want to store them in a hash table of size $7$ implemented with a dynamic array

A$,$ using the hash function $h(k)=$kmod$7,$ by handling collisions using chains.

Start with the array A being of size $7,$ with all entries initialised to None $($case$-$

sensitive$),$ and insert the items above in order $($a$,$ b$,$ c$,$ d$,$ e$,$ f$,$ and then g$).$ Fill the

blanks with the contents of each entry: if there is only one item in $A[i],$ then just

write the name of the item $($not the key!$),$ for instance $"$c$"$ without the double

quotes; if A points to a chain containing multiple items, just list them in alphabetical

order by separating them with a comma and no spaces. For example, if A$[2]$ points

to a chain containing items a and $b,$ fill the blank next to $]$ with $"$a$,$b$"$ without

the double quotes.

$A[0]=$

$A[1]=$

$A[2]=$

$A[3]=$

A$[4$