For the problem below, you need to show ALL OF YOUR COMPUTATIONS. If a number cannot be placed in the table with current hash functions, explain the reason and proceed to the next number in the array. If you do not show ALL OF YOUR COMPUTATIONS, I will not upvote the answer.

Q1. Given input [21, 19, 109, 81, 35, 32, 29] and a hash function h (:) = x mod 10, show the resulting table a-(25 pts) separate chaining hash table, b- (25 pts) hash table using linear probing, C-(25 pts) hash table using quadratic probing, d- (25 pts) hash table with second hash function h2 (x) = 7 (mod 7). For this question, the table size is 10 as it can be seen from main hash function