The newly added method should work as follow:

1. Takes two input objects L1 & L2 of type SinglyLinkedList,

2. L1 & L2 represents two Integer list in ascending order,

3. Returns an object L3 with the sorted merge value of L1 & L2

4. For example: L1= {1, 7, 12, 13, 20} and L2= {2, 3, 6, 9, 25},

5. Then: L3= {1, 2, 3, 6, 7, 9, 12, 13, 20, 25}

Idea of Working

While L1 is not empty and L2 is not empty:

If first element of L1 < first element of L2:

Remove first element L1

Insert element into L3

End if

Else:

Remove first element L2

Insert element into L3

End while

If L1 is not empty and L2 is empty:

Insert the rest of elements L1 into L3

If L2 is not empty and L1 is empty:

Insert the rest of elements L2 into L3-The newly added method should work as follow:

1. Takes two input objects L1 & L2 of type SinglyLinkedList,

2. L1 & L2 represents two Integer list in ascending order,

3. Returns an object L3 with the sorted merge value of L1 & L2

4. For example: L1= {1, 7, 12, 13, 20} and L2= {2, 3, 6, 9, 25},

5. Then: L3= {1, 2, 3, 6, 7, 9, 12, 13, 20, 25}

Idea of Working

While L1 is not empty and L2 is　not empty:

If first element of L1 < first element of L2:

Remove first element　L1

Insert element into L3

End if

Else:

Remove first element　L2

Insert element into L3

End while

If L1 is not empty and L2 is empty:

Insert the rest of elements　L1 into L3

If L2 is not empty and L1 is empty:

Insert the rest of elements　L2 into L3