Linear Probing Hash Table:

You have a hash table of length $13.$ Insert the strings $($keys$)$ with corresponding hash values in the order given into a linear probing hash table. Draw the resulting hash table. You don$$t need to draw the value table.:

data $0$

structures $4$

two $6$

is $0$

the $1$

fourth $6$

course $9$

on $1$

computer $9$

programming $9$