I. For this exercise, use the following modular arithmetic hashing function to find the index of the element in the hash table: Hash(x) = x mod 13. a. Start with an empty hashing table, using Open Addressing with Quadratic Probing. show how the following table HT would look like after inserting the following elements in this order into the table: 7, 22, 27, 23, 24, 25, 37, 107,12,43, 18, 35. Show your work by filling the table below that should show how the hashing table will look like after adding every 2 elements to the table. (Please note that, if after 6 probes, an item can't be inserted into the hashing table, leave it outside the table and mark that down) 0 1 3 4 5 6 7 8 10 11 12 HT Answer: After adding 7 and 22 After adding 27 and 23 After adding 24 and 25 After adding 37 and 107 After adding 12 and 43 After adding 18 and 35 0 1 2 3 4 5 6 7 8 9 10 11 12 b. If you are using a marker of "-1" to mark a deleted entry in the hashing table, and using Open Addressing with Quadratic Probing, show how the table from part a would look like after deleting 22, 25, 23, 27, and then adding 29, 215 and 51 to the table. 0 1 2 3 4 5 6 7 8 9 10 11 12