notes the given lists the resultant list you can merge two lists into one list the following program merges two circular lists lab exercise programinclude include struct node int datastruct node *link}struct node *insert(struct node *pint nstruct node *temp/if the existing list is empty then insert new node as the starting node *if( ==nullp=(struct node *)malloc(sizeof(struct node))/creates new node data value passes as parameter *if( ==null lovely professional university