Merge two sorted lists.

Advance a dummy-tail pointer, repeatedly linking the smaller current node, then append the remainder. Time is O(m+n) and extra space is O(1) when nodes are reused.

Test empty input, one-element input, duplicates, boundary indices, invalid states, and the largest allowed size; state time and space complexity.