Please help with Eclipse Java

2. Implement the methods below based on the following Java class definitions. For recursive methods you may only add one auxiliary function, and you may not add any instance nor static variables. public class LinkedList> I private class Node ( private T data; private Node next; private Node (T data) this.data -data; next null ; private Node head; public Linkedlist) ( head = null; Define a constructor that takes a TreeSet as a parameter and initializes a linked list with the elements in the set. The new list must be sorted in increasing lexicographic order. a. b. Define a RECURSIVE method named size that returns the number of elements in the list. The prototype for this method is public int size() Define a RECURSIVE method named inRange that returns a HashSet with the elements in the list that in the specified range. The range includes the lower and upper bound. The prototype for this method is: c. public HashSet nRange (T lowerBound , T upperBound) d. Define a RECURSIVE method named remove that removes all instances in the list that are equal to the 2. Implement the methods below based on the following Java class definitions. For recursive methods you may only add one auxiliary function, and you may not add any instance nor static variables. public class LinkedList> I private class Node ( private T data; private Node next; private Node (T data) this.data -data; next null ; private Node head; public Linkedlist) ( head = null; Define a constructor that takes a TreeSet as a parameter and initializes a linked list with the elements in the set. The new list must be sorted in increasing lexicographic order. a. b. Define a RECURSIVE method named size that returns the number of elements in the list. The prototype for this method is public int size() Define a RECURSIVE method named inRange that returns a HashSet with the elements in the list that in the specified range. The range includes the lower and upper bound. The prototype for this method is: c. public HashSet nRange (T lowerBound , T upperBound) d. Define a RECURSIVE method named remove that removes all instances in the list that are equal to the