Hash Tables 1. Show the result of inserting 29, 18, 40, 30, 19, 17, 51 and 28 to an empty hash table that uses the hash function "h(x) = x mod 11" and chaining for collision handling. 2. Search the keys 29, 18, 40, 32, 20, 17, 51 and 27 in the hash table constructed in Q1. Write down the elements checked in the hash table while searching each key. 3. Show the result of inserting 29, 18, 40, 30, 19, 17, 51 and 28 to an empty hash table that uses the hash function "h(x) = x mod 11" and open addressing with linear probing for collision handling 4. Search the keys 29, 18, 40, 32, 20, 17, 51 and 27 in the hash table constructed in Q3. Write down the elements checked in the hash table while searching each key