I ask you to write the code yourself and do not copy most of the experts who answered a mistake. If you do not know, do not answer a question so far I have raised a question 3 times and the answers are all the same If you solve the same solution as the method of past experts, I will give you a dislike and report

Write a complete C++ program that implements an open addressing Hash Table. Let the size of the keys n be a user specified input. Consequently, let the size of the Table m to be set as 3/2 n. You code:

• needs to support the search, insert and delete operations.
• must use the delete marker idea to efficiently deal with the delete operation.
• needs to ask the user to enter the total number of keys to be inserted n.
• needs to set m to equal 3/2 n.
• should generate the n keys randomly in the range [1,..., 100000] and print them.
• must use the double hashing collision resolution method. Use h1(k) = k mod m, h2(k) = R - k mod R, where R is a generated prime number that is just less than m. You should print these functions.
• must insert all the randomly generated keys. Your code must calculate and print the total number of collisions while inserting the keys.
• must provide a menu to the user that allows to perform some additional operations like inserting new key, delete a key or searching for certain key until the user choose to quit such menu and consequently ends your program. Note: for each performed operation above, you need to print the Hash table or show information from the hash table to demonstrate that such requested operation was successful.

Your final submitted code and report should include some sample results that demonstrate that your code is successfully and correctly working. You need to present 3 samples.

note:::I ask you to write the code yourself and do not copy most of the experts who answered a mistake. If you do not know, do not answer a question so far I have raised a question 3 times and the answers are all the same