From a user interface perspective, EV $3\mathrm{.}0$ will behave as described for EV $2\mathrm{.}0,$ except that there will beone additional data saving$/$display option, as follows.$$Enter $($o$)$utput$,($s$)$ort$,($f$)$ind$,($e$)$fficiency$,($m$)$erge$,($p$)$urge$,($r$)$ecords$,($h$)$ash table, or $($q$)$uit: $$If the user enters $$h$$ for hash table display, EV $3\mathrm{.}0$ will list the data with RecordIDs in the order they arestored in the hash table, each prepended with the bucket number $($hash code$)$ where it is stored, followedby a colon. If a bucket is empty, the bucket number and colon should be skipped. If a bucket overflows,the overflow items should be prepended with $$OVERFLOW:$$ and be displayed in their overflow orderbefore proceeding to the next bucket. There should also be a blank line displayed between buckets. Allof this will be followed by a blank line, then a line giving some data about the hash table, namely, its$$base capacity$($the size of the array, not counting any overflow$),$ its $$total capacity$($the size of thearray plus any separate chaining links used for overflow$),$ and its load factor. This is immediatelyfollowed by the usual line stating the number of data lines read, etc. As with the other datasaving$/$displaying options, if the user enters $$h$$ for hash display, EV $3\mathrm{.}0$ will prompt for an outputfilename and send the output to the standard out console if no file name is provided. Note that this isthought of as a debug display as it is unlikely to be of use to an end user but may help you to debug. everything is work but merge, purge, sort, and search, are probably not working according to the requirements. so if you could make the code for that or tell me how to make it work please.