Hi, could you please solve the question using Java Linked List

3 Linked List The following exercises deal with coding a LinkedList. The LinkedList is composed of generic Node objects. The LinkedList contains a Node head referencing the first node in the list. The LinkedList contains a Node tail referencing the last node in the list. The LinkedList contains a method size() that returns the number of elements in the list. The Node objects are doubly-linked, and contain public variables next and prev, which reference the next and previous nodes in the list respectively. (15 points) Suppose we had a new type of Linkedlist, called the SortedLinkedList, which is a linked list, but it keeps all the items in the list sorted. As a result, when we add an item to a SortedLinkedList, we don't provide an index, as the SortedLinkedList figures out where to put the new item based on the values already in the list. Your task is is to complete the add method for a SortedLinkedList, shown below. This method inserts a new item into the SortedLinkedList in such a way that the list remains sorted. For example, if the list is [1, 2,5] and we call add (4), the becomes [1,2,4,5). For simplicity: You can use either a singly or doubly linked list. you can use , and == to compare items, but if you remember how to use compareTo(), you can do so for extra credit. You may not call the add(int index , E item) method. You may not call the getNode () method (although you may rewrite it). Your solution must run in O(n) time. public void add(E item) {