(bdetermine the hash addresses and find how many collisions occur when these keys are first folded by adding their digits together (in ordinary decimal representationand then applying hash_size (cfind hash function that will produce no collisions for these keys ( hash function that has no collisions for fixed set of keys is called perfect (drepeat the previous parts of this exercise for hash_size ( hash function that produces no collision for fixed set of keys that completely fill the hash table is called minimal perfect another method for resolving collisions with open addressing is to keep separate array called the overflow tableinto which are put all entries that collide with an occupied location they can either be inserted with another hash function or simply inserted in orderwith sequential search used for retrieval discuss the advantages and disadvantages of this method with linear probingit is possible to delete an entry without using second special keyas follows mark the deleted entry empty search until another empty position is found if the search finds key whose hash address is at or before the just-emptied positionthen move it back theremake its previous position emptyand continue from the new empty position write an algorithm to implement this method do the retrieval and insertion algorithms need modification in chained hash tablesuppose that it makes sense to speak of an order for the keysand suppose that the nodes in each chain are kept in order by key then search can be terminated as soon as it passes the place where the key should beif present how many fewer probes will be doneon averagein an unsuccessful searchin successful searchhow many probes are neededon averageto insert new node in the right placecompare your answers with the corresponding numbers derived in the text for the case of unordered chains the hash table itself contained only listsone for each of the chains one variant method is to place the first actual entry of each chain in the hash table itself (an empty position is indicated by an impossible keyas with open addressing with given load factorcalculate the effect on space of this methodas function of the number of words (except linksin each entry ( link takes one word distinguish between linear and quadratic probing consider using division method of hashing store the following values in the hash table of size notes answersself assessment linked list open hashing collision deterministic symbol table hash function symbols truncation lovely professional university