Need help with this java assignment. Any help is appreciated. You can use eclipse for this.

Assignment is below:

The List ADTs are to implement the attached ListInterface.java, and include a toString() method. The underlying data structure for each implementation shall be a singly linked list that uses the attached LLNode.java node class.

A test program must also be developed. This program must verify each of the ADT operations and be consistent with the test plan.

Required elements:

all of your source code in a single Eclipse project

partial test plan

identify what the goals of your testing are, and describe what your approach to testing will be in order to meet these goals

exhaustive set of remove operation test cases

nota bene: this a test plan, not a report of the testing you actually did

Sorted List ADT

List elements must be Comparable and are to be maintained in the underlying linked list in sorted order, from least to greatest, as defined by the element's compareTo() method.

The name of your list ADT class must be SortedList. The class header will look like this:

public class SortedList> implements ListInterface

package listInterface: public interface ListInterface int size / return the number of elements on this list boolean isEmpty) void add (E element) boole n remove (E element) ; // remove an element e from thi li uch that // if no such element exists, return false boolean contains (E element) e.equals (element) and return true; //return true if this list contains an element e such that // otherwise, return talse E get(E element) e.equals (element) return an element e from this list such that // if no such element exists, return null Sering tostring e.equals (element) returns an appropriately formatted string that represents this list void reseticerator // set the current position for the getNext) iterator to the first element n the list E getNextitem) I Preconditions: The 1ist is not empty The resetIterator method has been invoked The list has not be modified since th most recent resetIterator) ca1l // return the element at the current position on this 1isti / update the current pointer to point to the next element on the list list element on the list note: if the element returned is the 1ast item on the set the value of the current position to the first