Using Java utilize a given List interface and construct the methods.

List is given as:

public interface List {

/**

* Returns the number of elements in this list.

*

* @return the number of elements in the list

*/

int size();

/**

* Returns true if this list contains no elements.

*

* @return true if this list contains no elements

*/

boolean isEmpty();

/**

* Removes all of the elements from this list.

*/

void clear();

/**

* Returns true if this list contains the specified element.

*

* @param element whose presence in this list is to be tested

* @return true if this list contains the specified element

*/

boolean contains(T element);

/**

* Returns an array containing all of the elements of the list

* in sequence. The size and contents of the array created

* are the size and contents of the list at the time

* that the method is called.

*

* @return an array containing all of the elements in this

* list in proper sequence

*/

T[] toArray();

/**

* Appends the specified element to the end of this list.

*

* @param element to be appended to this list

*/

void add(T element);

/**

* Removes the first occurrence of the specified element

* from this list, if it is present

*

* @param element to be removed from this list, if present

* @return true if this list contained the specified element and false otherwise

*/

boolean remove(T element);

/**

* Returns the element at the specified position in this list.

*

* @param index of the element to return

* @return the element at the specified position in this list

*/

T get(int index);

/**

* Replaces the element at the specified position in this list

* with the specified element.

*

* @param index of the element to replace

* @param element to be stored at the specified position

* @return the element previously at the specified position

*/

T set(int index, T element);

/**

* Inserts the specified element at the specified position in

* this list (optional operation). Shifts the element currently

* at that position (if any) and any subsequent elements to the

* right (adds one to their indices).

*

* The value of index must be in the range of 0 to the size of the

* list. Adding an element at index size will add the element to

* the end of the list.

*

* @param index at which the specified element is to be inserted

* @param element to be inserted

*/

void add(int index, T element);

/**

* Removes the element at the specified position in this list.

* Shifts any subsequent elements to the left

* (subtracts one from their indices).

*

* @param index of the element to be removed

* @return the element previously at the specified position

*/

T remove(int index);

/**

* Removes the first occurrence of the specified element from

* this list, if it is present.

*

* @param element to search for

* @return the index of the first occurrence of the specified

* element in this list, or -1 if this list does not contain

* the element.

*/

int indexOf(T element);

/**

* Returns the index of the first occurrence of the specified

* element in this list, or -1 if this list does not contain

* the element.

*

* @param element to search for

* @return the index of the last occurrence of the specified

* element in this list, or -1 if this list does not contain

* the element

*/

int lastIndexOf(T element);

}

Provide code for these methods in the interface using:

public class LinkedList {

}