(recursive and iterativegenerate randomordered list of integers and do benchmark analysis for each one what are your resultscan you explain them implement the binary search using recursion without the slice operator recall that you will need to pass the list along with the starting and ending index values for the sublist generate randomordered list of integers and do benchmark analysis implement the len method (__len__for the hash table map adt implementation implement the in method (__contains__for the hash table map adt implementation how can you delete items from hash table that uses chaining for collision resolutionhow about if open addressing is usedwhat are the special circumstances that must be handledimplement the del method for the hashtable class in the hash table map implementationthe hash table size was chosen to be if the table gets fullthis needs to be increased re-implement the put method so that the table will automatically resize itself when the loading factor reaches predetermined value (you can decide the value based on your assessment of load versus performance implement quadratic probing as rehash technique using random number generatorcreate list of integers perform benchmark analysis using some of the sorting algorithms from this what is the difference in execution speed implement the bubble sort using simultaneous assignment bubble sort can be modified to "bubblein both directions the first pass moves "upthe listand the second pass moves "down this alternating pattern continues until no more passes are necessary implement this variation and describe under what circumstances it might be appropriate implement the selection sort using simultaneous assignment perform benchmark analysis for shell sortusing different increment sets on the same list implement the merge_sort function without using the slice operator one way to improve the quick sort is to use an insertion sort on lists that have small length (call it the "partition limit"why does this make sensere-implement the quick sort and use it to sort random list of integers perform an analysis using different list sizes for the partition limit implement the median-of-three method for selecting pivot value as modification to quick_sort run an experiment to compare the two techniques sorting and searching