**Problem Statement:**
Given the required input arguments, write an efficient algorithm to solve the **Merge Two Sorted Lists** problem. Implement the required logic as specified by standard definitions for this classic algorithmic challenge.
**Hint / Expected Approach:**
Dummy head + compare and append
**Edge Cases to Consider:**
- (1) Both lists empty
- (2) One list empty
- (3) Lists of different lengths
Examples
Example 1
Input:[1,2,4], [1,3,4]
Output:[1,1,2,3,4,4]
Explanation: Basic merge
Example 2
Input:[], []
Output:[]
Explanation: Both empty
Example 3
Input:[], [0]
Output:[0]
Explanation: First empty
Constraints
▪The number of nodes in the list is in the range [0, 500]