be included in the hash table implementation of code fragments - explain how to modify class hashtablemap given in code fragments so that it implements the dictionary adt instead of the map adt - show the result of rehashing the hash table shown in figure into table of size using the new hash function ( mod - argue why hash table is not suited to implement an ordered dictionary - what is the worst-case time for putting entries in an initially empty hash tablewith collisions resolved by chainingwhat is the best caser- draw an example skip list that results from performing the following series of operations on the skip list shown in figure remove( )insert( , )insert( , )remove( record your coin flipsas well - give pseudo-code description of the remove operation in skip list - 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 ordered dictionary at the end of this series of operationswhat if each pair had lower cost and higher performance than the one before itr- argue why location-aware entries are not really needed for dictionary implemented with good hash table creativity -