this is data structure ,thank you

15. (10 points) Write a static method that takes in two sorted linked lists of integers and merges them into one sorted linked list and returns it. Since this a static method outside of Linkedlist, you cannot access the Nodes. You are allowed to remove items from listA and listB public static LinkedList merge(List lista, List listB) { 16. (2 points) What is the time complexity of this algorithm? 17. (10 points) Write a method that reverses a doubly-linked LinkedList. This method will be an in- stance method for LinkedList, so you can use the Node head and tail references and refer to the LinkedList object using the this keyword. // You have access to the Node class public void reverse() {