$1.$ In C$++$ programming, demonstrate the insertion of the data: $5,28,19,15,20,32,12,17,10,$ into a hash table with collision resolved by each of the following methods. You can do it by hand on paper or write a program to do it all.

a$.$ Chaining. Use H$[5]$

b$.$ Linear probing. Use H$[9]$

c$.$ Quadratic probing. Use H$[9]$

d$.$ Double probing. Use H$1[9]$ and H$2[9].$ Use linear probing in H$2$

e$.$ Count the number of comparisons to find each data in the table of part a $,$b$,$ c$,$ and d to determine the number of comparisons in each hash table. Please complete the following table