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

1351-03, Spring 2018, Lab 6 Name this proiect SortTimer2 Create a Class SortTimer2 with the following Methods: ic atatic void insertionsort (int 1 nums) hethod uses the insertion sort to sort an array of integers, named nums nto increasing order c static void selectionsort (int [] nums) s method uses the selection sort to sort an array of integers, named nums 2 public Thi into increasing order c static void mergesort (int [ nums, int left, int right) is method sorts the subarray nums [left..right] of the nums array into 3. public in cr easing order using the merge sort algorithm. Use the following pseudocode for this method: If left mid+1), then if (m mid) copy the remainder of nums [left. .mid] into the result array, otherwise copy the remainder of nums [mid+l. .right] into the result array. Then copy the result array to the subarray nums [left..right]. 4. public static void mergeSortprint int [l nums, int left, int right) Create this method by copying and pasting the mergeSort method in Step 3 above and then adding the statement: System.out.println ("numsArrays.toString (nums)) at the end of the method (right before the last in the method) public static void quickSort (int tl increasing order using the quick sort algorithm. Use the following pseudocode nums, int left, int right) thod sorts the subarray nums [left..right] of the nums array into for this method: If left