Data Structure and Algorithm Design CSCI 3000 Name: Assignment 3 -Linked List Linked list: Node: Yes, Node: We Node: All Node: Love Node: Weekends Date For this assignment, you will be completing several methods in a class named LinkedList.java file. You will fill in the implementation of the following methods using Nodes (you may use as a reference the LinkedList exercise we completed in class using java or C++) LinkedList is empty: false The size is:3 Linked list: Node: We Node: All Node: Love getFirst0 addFirst(item) contains( item) , set(int n, item) removeNthNode( int n) addNode(int n, item) removeLasto The data in the first node is: We The data in the last node is: All getLastO It is your task to implement each of the missing methods. The main) method in the LinkedList.java file instantiates a linked list that can hold Strings, but your code should work with any objects stored within the list. After completing all the methods, your output should look like: LinkedList is empty: true The size is:0 Linked list: LinkedList is empty: false The size is: 3 Linked list: Node: I Node: Love Node: CS 3000 LinkedList is empty: false The size is: 3 Linked list Node: We Node: Love Node: Weekends LinkedList is empty: false The size is: 5