Problem 1- Asssume keys 20, 33, 46, 59, 62, 75 are inserted in the given order into an initially empty hash table with m = 13 slots, using the hashing function h(k) = k mod 13. In which slots will these keys be placed using: (a) Linear probing. (b) Quadratic probing. (c) Double hashing with secondary hash function h2(k) = 1 + (k mod 7) .