Hash tables The same sequence of seven elements is used in the first two questions; the simple arithmetic has to be done only once. Sketch a hash table of size 11, where the hash function is hash index = key mod 11 and separate chaining is used to resolve collisions, after the following elements are inserted: 3, 16, 49, 56, 78, 84, 89 Sketch hash table of size 11, where the hash function is hash index = key mod 11 and a probing is used to resolve collisions, after the following elements are inserted: linear 49, 56, 78, 84, 89