Q:Question:How to merge two sorted linked lists? Explain? Write an algorithm to merge two sorted linked lists? Input: Head of following linked lists 1->2->3->4->NULL 1->2->5->6->7->8->NULL Output: Linked lists should be merged to, 1->2->3->4->5->6->7->8->NULL please provide the correct working code and algorithm for this and also provide explanation for this thanks!!!A:Answer:See a step by step answer