sec projects be sure to indicate how you are using and to do the hashing function rev(kreverses the decimal digits of kfor examplerev( rev( (kk mod ( (rev( mod keys write an algorithm for deletion function for hash tables that replaces the record with special value indicating tombstone modify the functions hashinsert and hashsearch to work correctly with tombstones consider the following permutation for the numbers to analyze what will happen if this permutation is used by an implementation of pseudo-random probing on hash table of size seven will this permutation solve the problem of primary clusteringwhat does this say about selecting permutation for use when implementing pseudo-random probing projects implement binary search and the quadratic binary search of section run your implementations over large range of problem sizestiming the results for each algorithm graph and compare these timing results implement the three self-organizing list heuristics countmove-to-frontand transpose compare the cost for running the three heuristics on various input data the cost metric should be the total number of comparisons required when searching the list it is important to compare the heuristics using input data for which self-organizing lists are reasonablethat ison frequency distributions that are uneven one good approach is to read text files the list should store individual words in the text file begin with an empty listas was done for the text compression example of section each time word is encountered in the text filesearch for it in the self-organizing list if the word is foundreorder the list as appropriate if the word is not in the listadd it to the end of the list and then reorder as appropriate implement the text compression system described in section implement system for managing document retrieval your system should have the ability to insert (abstract references todocuments into the systemassociate keywords with given documentand to search for documents with specified keywords