- what is the result of exercise - when collisions are handled by double hashing using the secondary hash function ( ( mod ) - what is the worst-case time for putting entries in an initially empty hash tablewith collisions resolved by chainingwhat is the best caser- show the result of rehashing the hash table shown in figure into table of size using the new hash function ( mod - our hashmapbase class maintains load factor < reimplement that class to allow the user to specify the maximum loadand adjust the concrete subclasses accordingly - give pseudo-code description of an insertion into hash table that uses quadratic probing to resolve collisionsassuming we also use the trick of replacing deleted entries with special "deactivated entryobject - modify our probehashmap to use quadratic probing - explain why hash table is not suited to implement sorted map - describe how sorted list implemented as doubly linked list could be used to implement the sorted map adt - what is the worst-case asymptotic running time for performing deletions from sortedtablemap instance that initially contains entriesr- consider the following variant of the find index method from code fragment in the context of the sortedtablemap classdef find index(selfklowhigh)if high lowreturn high elsemid (low high/ if self table[midkey kreturn self find index(kmid highelsereturn self find index(klowmid does this always produce the same result as the original versionjustify your answer - what is the expected running time of the methods for maintaining maxima set if we insert pairs such that each pair has lower cost and performance than one before itwhat is contained in the sorted map at the end of this series of operationswhat if each pair had lower cost and higher performance than the one before itr- draw an example skip list that results from performing the following series of operations on the skip list shown in figure del [ ] [ [ del [ record your coin flipsas well