exercise ( - in figure we give an illustration of hash table with separate chaining assuming we use good hash function to index the entries of our map in bucket array of capacity nwe expect each bucket to be of size / this valuecalled the load factor of the hash table (and denoted with )should be bounded by small constantpreferably below forgiven good hash functionthe expected running time of operations getputand remove in map implemented with hash table that uses this function is on/ thuswe can implement these operations to run in ( expected timeprovided is (nfigure hash table of size storing entries with integer keyswith colli sions resolved by separate chaining the compression function is (kk mod for simplicitywe do not show the values associated with the keys open addressing the separate chaining rule has many nice propertiessuch as allowing for simple implementations of map operationsbut it nevertheless has one slight disadvan tageit requires the use of an auxiliary data structure-- list--to hold entries with colliding keys we can handle collisions in other ways besides using the separate