Source code is C/C++./ Dont understand what do you mean with source language of hash map.

Assume a set of 5-digit integer numbers have been given as the key values. The goal of this experiment is comparing the performance of double hashing with linear probing. 1- Generate 1000 random numbers in the range of 10000 and 99999 as your key set 2- For linear probing choose appropriate h) function and m parameter 3- For double hashing choose h1) and h2() functions and m parameter 4- Create hash tables using both methods 5- Count the number of collisions in each method. Discuss the advantages of each method. For instance, we may consider clustering as a metric to compare the two methods (you do not need to include it here) Submit the source code, and the report including the experiment result and discussion