Suppose a hash table has 11 locations, keys are placed in the table using the hash function f (x) = x mod 11, and linear chaining is used to resolve collisions Draw a picture of the result of storing...

Suppose a hash table has 11 locations, keys are placed in the table using the hash function f (x) = x mod 11, and linear chaining is used to resolve collisions Draw a picture of the result of storing the following keys in the table: 0, 12, 42, 18, 6, 22, 8, 105, 97