suppose you are given the following set of keys to insert into hash table that holds exactly values which of the following best demonstrates the contents of the has table after all the keys have been inserted using linear probing ____ __ __ ____ ____ implementing the map abstract data type one of the most useful python collections is the dictionary recall that dictionary is an associative data type where you can store key-data pairs the key is used to look up the associated data value we often refer to this idea as map the map abstract data type is defined as follows the structure is an unordered collection of associations between key and data value the keys in map are all unique so that there is one-to-one relationship between key and value the operations are given below map(create newempty map it returns an empty map collection put(key,valadd new key-value pair to the map if the key is already in the map then replace the old value with the new value get(keygiven keyreturn the value stored in the map or none otherwise del delete the key-value pair from the map using statement of the form del map[keylen(return the number of key-value pairs stored in the map in return true for statement of the form key in mapif the given key is in the mapfalse otherwise one of the great benefits of dictionary is the fact that given keywe can look up the associated data value very quickly in order to provide this fast look up capabilitywe need an implementation that supports an efficient search we could use list with sequential or binary search but it would be even better to use hash table as described above since looking up an item in hash table can approach ( performance below we use two lists to create hashtable class that implements the map abstract data type one listcalled slotswill hold the key items and parallel listcalled datawill hold the data values when we look up keythe corresponding position in the data list will hold the associated data value we will treat the key list as hash table using the ideas presented earlier note that the initial size for the hash table has been chosen to be although this is arbitraryit is important that the size be prime number so that the collision resolution algorithm can be as efficient as possible sorting and searching