hash tables do the same as in exercise but use the following hash function to map the keys to the table entriesh(key( key show the contents of the hash table from exercise after rehashing with new table containing entries consider hash table of size that contains keys (awhat is the load factor(bwhat is the average number of comparisons required to determine if the collection contains the key ifi linear probing is used ii quadratic probing is used iii separate chaining is used do the same as in exercise but for hash table of size that contains keys show why the table size must be prime number in order for double hashing to visit every entry during the probe design hash function that can be used to map the two-character state abbreviations (including the one for the district of columbiato entries in hash table that results in no more than three collisions when used with table where programming projects implement the remove operation for the hashmap adt design and implement an iterator for use with the implementation of the hashmap adt modify the implementation of the hashmap adt to(ause linear probing instead of double hashing (buse quadratic probing instead of double hashing (cuse separate chaining instead of closed hashing design and implement program that compares the use of linear probingquadratic probingand double hashing on collection of string keys of varying lengths the program should extract collection of strings from text file and compute the average number of collisions and the average number of probes implement the color histogram adt using the - array of chains as described in the