Merging two sorted singly linked lists

Given pointers to the first nodes of two sorted singly linked lists: firstList and secondList. The task is to merge them into a single sorted list, also in ascending order. The result should be assembled by reusing nodes from the original lists, without creating new objects.