Insert the following keys into an initially empty hash table of 11 slots, numbered 0 through 10, using the hash function h(k) = (3k + 5) mod 11 and assuming collisions are handled by linear probing: 11, 8, 2, 32, 12, 7, 4, 40, 26. You are to draw the final hash table. Same as before, but assuming collisions are handled by quadratic probing. Same as before, but assuming collisions are handled by double hashing using the secondary hash function h'(k) = 7 - (k mod 7)