Merge Two Sorted ListsEasyAcceptance Rate 62.5%Merge two sorted linked lists and return it as a sorted list.ExamplesExample 1Inputl1 = [1,2,4], l2 = [1,3,4]Output[1,1,2,3,4,4]ConstraintsThe number of nodes in both lists is in the range [0, 50].-100 <= Node.val <= 100Both l1 and l2 are sorted in non-decreasing order.