C++ Please!

1. Write a program to compute the number of collisions when inserting a sequence of 20 random integers between 0 and 100. Insertion should be done once using the linear probing and then separately with quadratic probing for collision resolution. Use a table size of 3 Output must display the list of integers inserted and the hash tables after insertions. The program must display the number of collisions in each collision resolution strategy as well.

1. Insert the sequence of numbers 4371, 1323, 6173, 4199, 4344, 9679, 1989 in a hash table of size 10 using the hash function Show the hash tables after insertions using the following collision resolution strategies. Clearly show calculations and indicate cases where a number cannot be inserted in the table.
   1. Separate chaining hash table
   2. Hash table using linear probing
   3. Hash table using quadratic probing
   4. Hash table with double hashing. Use the second hash function