You are given an empty hash table of size 7. The following sequence of keys is to be inserted: 15 17 8 23 3 5 Insert these keys using each of the following approaches to deal with collision. If overflow occurs, say so, and indicate the element that causes the overflow

IlI-2. Hashing (15 points total; 5 points each part) You are given an empty hash table of size 7. The following sequence of keys is to be inserted 15 17 8 23 35 Insert these keys using each of the following approaches to deal with collision. If overflow occurs, say so, and indicate the element that causes the overflow. a. h(x) = x 96 7; linear probing b, h(x) : x 96 7; quadratic probing c. h(x) = x % 7; double hashing with h2(x-x/ 7 + 1 (using integer division)