Merge two sorted singly linked lists in java (example / recursive)

Given the two sorted linked lists, we need to merge these linked lists into single linked list. The resultant linked list should also in sorted one. Let us take a look into the examples to clear our problem statement.