I need help with this Java program. That's I have so far. And I need to fill out these methods:

public static void mergeSort(int[] nums, int left, int right)

public static void mergeSortPrint(int[] nums, int left, int right)

public static void quickSort(int[] nums, int left, int right )

public static int partition(int[] nums, int left, int right)

public static void quickSortPrint(int[] nums, int left, int right )

Thank you

Name this project SortTimer2 351-03, Spring 2018, Lab 6 a class SortTimer2 with the following Methods: c static void insertionsort (int [1 nums) s method uses the insertion sort to sort an array of integers, named nums, public This into increasing order 2public statie void selectionsort (int [J nums) This into increasing order 8 method uses the selection sort to sort an array of integers, named nums, void mergesort (int[] nums, int left, int right) sorts the subarray nums [left. .right] of the nums array into 3. public static Th for this method: If left mid+1), then if (m S mid) copy the remainder of nums [left..mid] into the result array, otherwise copy the remainder of nums [mid+1. .right] into the result array. Then copy the result array to the subarray nums [left..right]