initially empty map that is implemented with listr- describe how to use map to implement the dictionary adtassuming that the user does not attempt to insert entries with the same key - describe how an ordered list implemented as doubly linked list could be used to implement the map adt - what would be good hash code for vehicle identification numberthat 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 - what is the result of exercise - when collisions are handled by double hashing using the secondary hash function '( ( mod ) - 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 -