Hash Table Storage

Implement 2 different hash table storages that store the same M known malware hashes/signatures. Your data storage should be able to hold up to 10,000 entries.
For the hash table, implement two types of hash tables using two different probing approaches for adding and searching for elements in the hash table: one using linear probing, and another using quadratic probing. Use any hashing function with your hash tables, but make sure to justify the selection of the hashing function in your report.
Randomly generate M hash values and store one copy of each in the different storage tables. These values will represent the hashes/signatures of known malwares
Randomly generate 1000 hash values (N), and search for these values in the storage tables.
For each type of storage, plot the running time for the creation of storages (randomly generating M hash values and inserting them in the storage), for different values of M = 1000, 2000, 3000, 4000, 5000, 6000, 7000, 8000, 9000. Plot also the total running time for searching for the N values.
Comments on the performances of using the different types of search algorithms with the different storages.