How to merge two unsorted linked lists to get a sorted list?

Write a program to merge two unsorted linked lists. Given lists l1 = (4, 2, 7)
and l2 = (5, 1), after return from merge the list should be changed to sorted list = (1,2,4,5,7).

>Solution :

You can get the answer of this question by simple google search. Refrain from asking such questions.