$****$ I just need the java code for MySorts.java and Main.java$****$

$*$IList$.$java$*$

public interface IList$>\{$

$/**$

Adds an element at the end of the list.

$*/$

public void add$($T item$)$;

$/**$

Stores a new item at a specified index

Throws NoSuchElementException if index is out of bounds.

$*/$

public void set$($int index, T item$)$;

$/**$

Inserts an element at the specified index

Throws NoSuchElementException if index is out of bounds.

$*/$

public void insert$($int index, T item$)$;

$/**$

Removes the element at the specified index

Throws NoSuchElementException if index is out of bounds.

$*/$

public void remove$($int index$)$;

$/**$

Returns the element at the specified index

Throws NoSuchElementException if index is out of bounds.

$*/$

public T get$($int index$)$;

$/**$

Returns the size of the list.

@return the number of elements in the list

$*/$

public int size$()$;

$\}$

$*$MyArrayList$.$java$*$

import java.util.ArrayList;

public class MyArrayList$>$ implements IList $\{$

private ArrayList list $=$ new ArrayList$()$;

@Override

public void add$($T item$)\{$

list.add$($item$)$;

$\}$

@Override

public int size$()\{$

return list.size$()$;

$\}$

@Override

public T get$($int index$)\{$

return list.get$($index$)$;

$\}$

@Override

public void set$($int index, T item$)\{$

list.set$($index$,$ item$)$;

$\}$

@Override

public void insert$($int index, T item$)\{$

list.add$($index$,$ item$)$;

$\}$

@Override

public void remove$($int index$)\{$

list.remove$($index$)$;

$\}$

$\}$

Additional Information

MySorts merge sort algorithm

the mergesort method will take a reference to an IList object as its only argument. This method will call the mergesortHelper method to do the actual work of sorting the list. This is the method that one would call to apply the quicksort algorithm to a list of values. By the time this method returns, the values in the argument IList should be sorted.

the mergesortHelper method is a recursive method that will implement the actual merge sort algorithm. The argument is a reference to the list of values that is to be sorted. this method will call the getLeftHalf and getRightHalf methods to divide a larger list, and call the merge method to merge two sorted sub$-$lists into one sorted list.

the getLeftHalf method will take as its argument, a reference to the list of values that is to be sorted. This method will return an IList that contains the first half of the list that was passed to it as an argument.

For examples:

given an IList named list, of these values $\{1,2,3,4\},$ getLeftHalf$($list$)$ would return an IList with these values $\{1,2\}$;

given an IList named list, of these values $\{3,6,2,5,4,1,7\},$ getLeftHalf$($list$)$ would return an IList with these values $\{3,6,2\}$

Note that for lists with an odd number of values $($like $\{3,6,2,5,4,1,7\}),$ the getLeftHalf method should return the smaller half of the list $($i$.$e$.\{3,6,2\}$ instead of $\{3,6,2,5\}).$

the getRightHalf method will take as its argument, a reference to the list of values that is to be sorted. This method will return an IList that contains the second half of the list that was passed to it as an argument.

For examples:

given an IList named list, of these values $\{1,2,3,4\},$ getRightHalf$($list$)$ would return an IList with these values $\{3,4\}$;

given an IList named list, of these values $\{3,6,2,5,4,1,7\},$ getRightHalf$($list$)$ would return an IList with these values $\{5,4,1,7\}$

Note that for lists with an odd number of values $($like $\{3,6,2,5,4,1,7\}),$ the getRightHalf method should return the larger half of the list $($i$.$e$.\{5,4,1,7\}$ instead of $\{4,1,7\}).$

the merge method will take two sorted lists as arguments. This method must create a new IList and merge the two argument lists into one sorted list that will be returned.

For examples:

given an IList named list$1,$ of these values $\{2,4,6\},$ and an IList named list$2,$ of these values $\{1,3,5\},$ merge$($list$1,$ list$2)$ would return an IList with these values $\{1,2,3,4,5,6\}$;

given an IList named list$1,$ of these values $\{1,4,5,8\},$ and an IList named list$2,$ of these values $\{2,3,4,7,9\},$ merge$($list$1,$ list$2)$ would return an IList with these values $\{1,2,3,4,4,5,7,8,9\}$;