this project, you will maintain the information of a dictionary usingHashing. Your program will read the words and their meanings$($synonyms$)$ from a file named words.txt$.$ As well, the user should beable also to enter new words $($and their meanings$)$ into the program.Please use the following format for inputsWord:Meaning$1$#Meaning$2$#Meaning$3$Example:good:fine#excellent#greatNote that each word will consist of max of three synonyms only.You will have to create a hash table to store the words and use wordsas the keys. You should implement hashing in two different methodsto resolve collisions using open$-$addressing and double hashing andgenerate $2$ different hash tables each using the different methods.The following options should be available for the user. For each option,you should provide the related information for both hash tables youhave created:$1.$ Print hashed tables $($including empty spots$)\mathrm{.}2.$ Print out table size and the load factor$\mathrm{.}3.$ Print out the used hash functions$\mathrm{.}4.$ Insert a new record to hash table $($insertion will be done onboth hash tables$)\mathrm{.}5.$ Search for a specific word $($specify which table to search in$)\mathrm{.}6.$ Delete a specific word $($from both tables$)\mathrm{.}7.$ Compare between the two methods in terms of number ofcollisions occurred. Here you have to print the number ofcollisions occurred $($if happened$)$ once every new word isinserted$\mathrm{.}8.$ Save hash table back to a file named saved$\_$words.txt $($of thedouble hashing$)$