Note: I am using Microsoft Visual Studio 2012 in C++.

The following code currently initializes a hash table of size 100 000 (one hundred thousand), and inserts 100 million elements. The program then generates a random number and searches the hash table for it.

The time it took to insert all the elements, as well as the time taken to do the search are both reported.

How do I implement the following functions in this code are: hashing, inserting, searching, and deleting? They should all be able to perform quickly.

hasl-Tables2 - Miciesoft Visusl Sludio Express 2012 for Windows Deskiup Quick Launch (Cti+o IL[ CDIT ViCW PROJECT BUILD DLDLIG TLAM TCOLS TLST WINDOW ILLP o , o TB e "" .. Local Windows Debugger , Debug win32 HashTablc.h hashTablos?.cpp Pncperties Global Scope: mainjint arc, const char arg- hashTables2.cpp Defines the entry point for the console application #include include #include "HashTable-h" .RandonSupport.h" .TimeSupport.h using nanespace std int "aln(int argc, const char * angvm int N 18082608; int K 18080 HashTablo c-HashTabl(K); timestanp insertBegincurrent_tine for (int 1 1<>