You are required to complete the LinkedList class. This class is used as a linked list that has many methods to perform operations on the linked list. To create a linked list, create an object of this class and use the addFirst or addLast or add (must be completed) to add nodes to this linked list(I created one linked list in TestLinkedList). I’ve already created the class for you and have some completed method in there, your job is to complete the empty methods.For every method you have to complete, you are provided with a header, Do not modify those headers( method name, return type or parameters). You have to complete the body of the method. public void add(T afterThis, T info) The parameter info will be the information the new node should contain, and the new node will be added after the node that contains the parameter afterThis as an information public void removeFirst() Removes the first node in the linked list. Hint: be aware of empty lists. public void removeLast() Removes the last node in the linked list. Hint: be aware of empty lists. public int size() returns the size of the linked list. public boolean isEmpty() returns true if the linked list is empty, otherwise returns false. public boolean contains(T item) returns true if the list contains a node with the same information as the parameter of the method. Test your method with TestLinkedList, complete one method at the time and uncomment the method calls in the main method. package chapter02; public class LinkedList { protected LLNode list; public LinkedList() { list = null; } public void addFirst(T info) { LLNode node = new LLNode(info); node.setLink(list); list = node; } public void addLast(T info) { LLNode curr = list; LLNode newNode = new LLNode(info); if(curr == null) { list = newNode; } else { while(curr.getLink() != null) { curr = curr.getLink(); } curr.setLink(newNode); } } public void add(T afterThis, T info) { //TODO Complete this method as required in the homework instructions } public void removeFirst() { //TODO Complete this method as required in the homework instructions } public void removeLast() { //TODO Complete this method as required in the homework instructions } public int size() { //TODO Complete this method as required in the homework instructions } public boolean isEmpty() { //TODO Complete this method as required in the homework instructions } public boolean contains(T item) { //TODO Complete this method as required in the homework instructions } public void display() { LLNode currNode = list; while(currNode != null) { System.out.println(currNode.getInfo()); currNode = currNode.getLink(); } } }

You are required to complete the LinkedList class. This class is used as a linked list that has many methods to perform operations on the linked list. To create a linked list, create an object of this class and use the addFirst or addLast or add (must be completed) to add nodes to this linked list(I created one linked list in TestLinkedList). I’ve already created the class for you and have some completed method in there, your job is to complete the empty methods.For every method you have to complete, you are provided with a header, Do not modify those headers( method name, return type or parameters). You have to complete the body of the method. public void add(T afterThis, T info) The parameter info will be the information the new node should contain, and the new node will be added after the node that contains the parameter afterThis as an information public void removeFirst() Removes the first node in the linked list. Hint: be aware of empty lists. public void removeLast() Removes the last node in the linked list. Hint: be aware of empty lists. public int size() returns the size of the linked list. public boolean isEmpty() returns true if the linked list is empty, otherwise returns false. public boolean contains(T item) returns true if the list contains a node with the same information as the parameter of the method. Test your method with TestLinkedList, complete one method at the time and uncomment the method calls in the main method. package chapter02; public class LinkedList { protected LLNode list; public LinkedList() { list = null; } public void addFirst(T info) { LLNode node = new LLNode(info); node.setLink(list); list = node; } public void addLast(T info) { LLNode curr = list; LLNode newNode = new LLNode(info); if(curr == null) { list = newNode; } else { while(curr.getLink() != null) { curr = curr.getLink(); } curr.setLink(newNode); } } public void add(T afterThis, T info) { //TODO Complete this method as required in the homework instructions } public void removeFirst() { //TODO Complete this method as required in the homework instructions } public void removeLast() { //TODO Complete this method as required in the homework instructions } public int size() { //TODO Complete this method as required in the homework instructions } public boolean isEmpty() { //TODO Complete this method as required in the homework instructions } public boolean contains(T item) { //TODO Complete this method as required in the homework instructions } public void display() { LLNode currNode = list; while(currNode != null) { System.out.println(currNode.getInfo()); currNode = currNode.getLink(); } } }