If $h(x)=$xmod$7($i$.$e$.$ the hash table has $7$ rows$)$ and separate chaining resolves collisions,

what does the hash table look like after all the following insertions occur: $5,8,10,24,15,$

$32,17,14,19,38,7,23?$ Assume that each node item contains only a search key for its

data.

Draw the FINAL representation of the hash table clearly $-$ if I can't understand them then

you lose points.