Data Structures and Algorithms: Write reasonably syntactically correct code: (a diagram of your "list" and "nodes" is helpful!) Given the following definitions for a sorted linked list: Public Class LListSorted {private LnodeHead;} Class Lnode{Object data: Lnode next;} Write a method in the LListSorted class that will accept as parameters two sorted lists}lst1 and 1st2, and create a new list that will merge the elements of 1st I and lst2 into a single sorted linked list. The method should return the new list. Your code will be graded on correctness and efficiency of the code. Please include the time complexity of your method