notes if and are the pointers to the sorted lists to be mergedthen we compare the data value stored in the first node of the list pointed to by with the data value stored in the first node of the list pointed to by andif the data value in the first node of the list pointed to by is less than the data value in the first node of the list pointed to by qmake the first node of the resultant/merged list to be the first node of the list pointed to by pand advance the pointer to make it point to the next node in the same list if the data value in the first node of the list pointed to by is greater than the data value in the first node of the list pointed to by qmake the first node of the resultant/merged list to be the first node of the list pointed to by qand advance the pointer to make it point to the next node in the same list repeat this procedure until either or becomes null when one of the two lists becomes emptyappend the remaining nodes in the non-empty list to the resultant list null null two sorted lists before merging if the above lists given as inputwhat would be the output of the program after each passr temp null null null null null null null after the first pass temp null after the second pass temp null after the third pass contd lovely professional university