Hash Functions 12. Let S - (one, two, three, four, five, six, seven, eight, nine and let f:S+ No be defined by f(x) (3) mod 9, where lxl means the number of letters in z. For each of the following gaps, construct a hash table that contains the strings of S by choosing a string for entry in the table by the order that it is lis Resolve collisions by linear probing with the given gap an ted in S. observe whether all strings can be placed in the table. a. Gap-1. b. Gap 2. c. Gap-3. d. Gap