Problem 21: Merge Two Sorted Lists Difficulty: Easy Problem Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. Example