exercises for help with exercisesplease visit the sitewww wiley com/college/goodrich reinforcement - give concrete implementation of the pop method in the context of the mutablemapping classrelying only on the five primary abstract methods of that class - give concrete implementation of the itemsmethod in the context of the mutablemapping classrelying only on the five primary abstract methods of that class what would its running time be if directly applied to the unsortedtablemap subclassr- give concrete implementation of the itemsmethod directly within the unsortedtablemap classensuring that the entire iteration runs in (ntime - what is the worst-case running time for inserting key-value pairs into an initially empty map that is implemented with the unsortedtablemap classr- reimplement the unsortedtablemap class from section using the positionallist class from section rather than python list - which of the hash table collision-handling schemes could tolerate load factor above and which could notr- our position classes for lists and trees support the eq method so that two distinct position instances are considered equivalent if they refer to the same underlying node in structure for positions to be allowed as keys in hash tablethere must be definition for the hash method that is consistent with this notion of equivalence provide such hash method - what would be good hash code for vehicle identification number that is string of numbers and letters of the form " xx xx ,where " represents digit and an "xrepresents letterr- draw the -entry hash table that results from using the hash functionh( ( mod to hash the keys and assuming collisions are handled by chaining - what is the result of the previous exerciseassuming collisions are handled by linear probingr- show the result of exercise - assuming collisions are handled by quadratic probingup to the point where the method fails