13. Let S = {one, two, three, four, five, six, seven, eight} and suppose that h: S N8 is the hash function defined by

(x) = length(x) mod 8, where length(x) is the number of letters in x. Use h to place each element of S into the following hash table starting with one, then two, and so on until eight. Resolve collisions by linear probing with a gap of 3.

0 _________

1 _________

2 _________

3 _________

4 _________

5 _________

6 _________

7 _________