notes prev -link curr -link free curr )return( )/ function to compute the length of linked list *int length struct node * int count while !null count++ ->linkreturn count figure before deletion pointer node to be deleted figure after deletion pointer inserting node after the specified node in singly linked list to insert new node after the specified nodefirst we get the number of the node in an existing list after which the new node is to be inserted this is based on the assumption that the nodes of the list are numbered serially from to the list is then traversed to get pointer to the nodewhose number is given if this pointer is xthen the link field of the new node is made to point to the node pointed to by xand the link field of the node pointed to by is made to point to the new node figures and show the list before and after the insertion of the noderespectively lovely professional university