Write a java class named First_Last_Recursive_Merge_Sort that implements the recursive algorithm for Merge Sort.

Write a java class named First_Last_Recursive_Merge_Sort that
implements the recursive algorithm for Merge Sort.
You can use the structure below for your implementation.

public class First_Last_Recursive_Merge_Sort {

//This can be used to test your implementation.
public static void main(String[] args) {

final String[] items = {"Zeke", "Bob", "Ali", "John",
"Jody", "Jamie", "Bill", "Rob", "Zeke", "Clayton"};

display(items, items.length - 1);
mergeSort(items, 0, items.length - 1);
display(items, items.length - 1);
}

private static <T extends Comparable<? super T>>
void mergeSort(T[] a, int first, int last)
{

//<Your implementation of the recursive algorithm for Merge Sort
should go here>

} // end mergeSort

private static <T extends Comparable<? super T>>
void merge(T[] a, T[] tempArray, int first,
int mid, int last)
{

//<Your implementation of the merge algorithm should go here>

} // end merge


//Just a quick method to display the whole array.
public static void display(Object[] array, int n)
{
for (int index = 0; index < n; index++)
System.out.println(array[index]);
System.out.println();
} // end display
}// end First_Last_Recursive_Merge_Sort