if (flag = for ( ; key; ++if (hti =valflag key ibreakif (flag = found= printf("\ the item searched was found at position % !"key )else key - printf"\nthe item searched was not found in the hash table)void delete_val(search_val()if (found== if key !- printf"\nthe element deleted is % "htkey )htkey - output menu insert search delete display exit enter your option enter the element to be inserted : enter your option - - - - - - - - - enter your option collision resolution by chaining in chainingeach location in hash table stores pointer to linked list that contains all the key values that were hashed to that location that islocation in the hash table points to the head of the linked list of all the key values that hashed to howeverif no key value hashes to lthen location in the hash table contains null figure shows how the key values are mapped to location in the hash table and stored in linked list that corresponds to that location