Question $1$:

Write an algorithm to merge two Singly Linked Lists. Assume that the data in each list are in ascending order. The algorithm should return a one Singly Linked List, containing all the data in ascendings order.

For example, if the lists are:

$36610454550$ and

$235560$

After the merge, the result is:

$23366104545505560$