Separate$-$Chaining Hash Table $(5)$:

You have a hash table of length $13.$ Insert the following strings in the order given into a separate$-$chaining hash table with the hash values specified:

data $0$

structures $4$

two $6$

is $0$

the $1$

fourth $6$

course $9$

on $1$

computer $9$

programming $9$

Draw only the final hash table. Notice that here the strings provided are the keys and the corresponding values are not given, so for each entry you only need to draw the key without the value. Also notice that whenever you insert a new node into a chain which is a linked list, you should insert into its head.