in Java

As we discussed in class, you need to implement the following things: A generic List interface, which encapsulates the ADT for a list data structure A generic LinkedList class, which implements List interface A generic LinkedListNode class A Junit test class LinkedList Tester, which should test all the functions you imple mented in your Linked List class and LinkedListNode class 3 ADT for a list data structure Got data stored in head node of list public T get First(); * Get the head node of the li public ListNode get FirstNode BE . Get data stored in tal mode of public T get Last(): Insert a new node with data at the public void insertFirst( f data ); Lusert a new node with data after currentNode public void insert After ( List Node currentNode. T data : Insert a new node with data at the tail of the list publie void insert Last ( T data ): Remove head node public void delete First (: * Remove it node publie void deleteLast(): Remove mode following currentNode + 1 nenode exists for currentNode is the tail do nothing public void delete Next ( ListNode currentNode): Get the number of elements in this list public int size(): Check the list i t publie boolean isEmpty() As we discussed in class, you need to implement the following things: A generic List interface, which encapsulates the ADT for a list data structure A generic LinkedList class, which implements List interface A generic LinkedListNode class A Junit test class LinkedList Tester, which should test all the functions you imple mented in your Linked List class and LinkedListNode class 3 ADT for a list data structure Got data stored in head node of list public T get First(); * Get the head node of the li public ListNode get FirstNode BE . Get data stored in tal mode of public T get Last(): Insert a new node with data at the public void insertFirst( f data ); Lusert a new node with data after currentNode public void insert After ( List Node currentNode. T data : Insert a new node with data at the tail of the list publie void insert Last ( T data ): Remove head node public void delete First (: * Remove it node publie void deleteLast(): Remove mode following currentNode + 1 nenode exists for currentNode is the tail do nothing public void delete Next ( ListNode currentNode): Get the number of elements in this list public int size(): Check the list i t publie boolean isEmpty()