cont code to search value /the element is searched in the linked list whose pointer to its head is stored in the location given by (kif search is successfulthe function returns pointer to the node in the linked listotherwise it returns null the worst case running time of the search operation is given as order of size of the linked list *node *search_value(node *hash_table[]int valnode *ptrptr hash_table[ ( )]while (ptr!=null&(ptr -value !val)ptr ptr -nextif (ptr->value =valreturn ptrelse return nullcode to delete value /to delete node from the linked list whose head is stored at the location given by (kin the hash tablewe need to know the address of the node' predecessor we do this using pointer save the running time complexity of the delete operation is same as that of the search operation because we need to search the predecessor of the node so that the node can be removed without affecting other nodes in the list *void delete_value (node *hash_table[]int valnode *save*ptrsave nullptr hash_table[ ( )]while ((ptr !null&(ptr value !val)save ptrptr ptr nextif (ptr !nullsave next ptr nextfree (ptr)else printf("\ value not found")example insert the keys and in chained hash table of memory locations use (kk mod in this casem= initiallythe hash table can be given asstep key step key ( mod ( mod create linked list for location and store the key value in it as its only node null null null null null null null null create linked list for location and store the key value in it as its only node null null null null null null null null null null null null null null null null