PROBLEM 1 Hash Table: Consider a hash table with ten hash locations. Using the hash function h(x) = x mod 10, insert the keys (33, 54, 69, 74, 18, 19) (in the order given) into the hash table, Use the secondary hash function () 1 (x mod9) for collision resolution. Draw the resulting hash table. What happens when you attempt to insert the key 94 into the final hash table obtained in hash table Explain. 0 1 2 3 4 5 6 7 8 9