Problem Statement

Merge Sorted Lists Problem Description You're handed two linked lists, each already sorted, and your job is to combine them into one linked list that is also sorted. Write a function merge_sorted_lists that accepts the two linked lists and produces a new linked list holding every element from both inputs, arranged in non-decreasing order. Input Format The first line contains an integer n1 , which is the number of elements in the first set. The next n1 lines contain the elements of the first set. The line after the last element of the first set contains an integer n2 , which is the number of elements in the second set. The following n2 lines contain the elements of the second set. Output Format Return a single linked list represented by a Python list, containing all the integers from both input lists, sorted in non-decreasing order. Constraints Each linked list contains at most 10 5 elements. The elements in the linked lists are integers and are within the range of -10 9 to 10 9 . Examp