1. (15 points) In this problem you will check your understanding of collision resolution techniques in hash tables. Given the input {4371,1323,6173,4199,4344,9679,1989}, a fixed table size of 10 , and a hash function H(X)=Xmod10, insert the values in order and show the resulting final... a. Linear probing hash table b. Quadratic probing hash table c. Separate chaining hash table