Create a test program to test this MergeSort Program: package ArraySplit;   import java.util.Arrays;   public class ArraySplit { public static void mergeSort(int[] a, int n) { if (n < 2) { return; } int mid = n / 2; int[] l = new int[mid]; int[] r = new int[n - mid];   for (int i = 0; i < mid; i++) { l[i] = a[i]; } for (int i = mid; i < n; i++) { r[i - mid] = a[i]; } mergeSort(l, mid); mergeSort(r, n - mid);   merge(a, l, r, mid, n - mid); }   public static void merge(int[] a, int[] l, int[] r, int left, int right) {   int i = 0, j = 0, k = 0; while (i < left && j < right) { if (l[i] <= r[j]) { a[k++] = l[i++]; } else { a[k++] = r[j++]; } } while (i < left) { a[k++] = l[i++]; } while (j < right) { a[k++] = r[j++]; } } }

Mergesort is a method that takes an integer array and returns a sorted copy of the same array. It first sorts the left half of the input array, then the right half of the input array, and finally merges the two sorted halves together into a sorted version of the input array. Implement the mergesort method    public static int[] mergesort(int[] arr) {         return new int[] {-1};     }     *must be in this layout and done in java

Java language Use arrays in creating your class. Stack Interface (LIFO) void push(Object)  Object pop() String toString() boolean isEmpty() boolean equals(Object) getIndexOf get remove   private static void arrayListTests() { System.out.println("ArrayList Tests"); // todo: make more tests here ArrayList a = new ArrayList(); System.out.println("Check empty array isEmpty:" + a.isEmpty()); a.insert('B', 0); a.insert('a', 0); a.insert('t', 1); System.out.println("Check non-empty array isEmpty:" + a.isEmpty()); System.out.println(a.toString()); while (a.isEmpty() == false) { System.out.println(a.remove(0)); }   // Fill over initial capacity and check that it grows for (int i = 0; i < 110; i++) { a.append(new Integer(i)); } System.out.println("Size of array after 110 adds: "+ a.size()); System.out.println("Value of last element: "+ a.get(a.size()-1)); System.out.println("Insert past end of list"); a.insert('z', 200); System.out.println("Insert negative index"); a.insert('z',  -3);…

import java.util.ArrayList;import java.util.Scanner;public class CIS231A4JLeh {public static void main(String[] args) {Scanner scnr = new Scanner(System.in);ArrayList<Integer> integers = new ArrayList<>();String input = scnr.nextLine();while (input.isEmpty()) {String[] parts = input.split("\\s+");for (String part : parts) {try {integers.add(Integer.parseInt(part));} catch (NumberFormatException ignored) {}}input = scnr.nextLine();}System.out.println("Jakob");System.out.println("Number of integers input: " + integers.size());System.out.println("All values input, in ascending order:");printIntegers(integers);System.out.println("Lowest value input: " + integers.get(0));System.out.println("Highest value input: " + integers.get(integers.size() - 1));System.out.printf("Average of all values input: %.2f%n", calculateAverage(integers));System.out.println("Mode of the data set and its frequency: " + calculateMode(integers));}private static void printIntegers(ArrayList<Integer>…

What type of sort is represented by the following code? public class MysterySortExample { public static void mysterySort(int array[]) { array.length; for (int j = 1; j -1) && ( array [i] > key )){ array [i+1] = array [i]; i-; } array[i+1] = key; A insertion bubble selection merge quick F heap

What type of sort is represented by the following code? public void sort(int arrayToSort[]) { int n = arrayToSort.length; for (int num =n/2; num > 0; num /= 2) { for (int i = num;i= num && arrayToSort[j - num] > key) { arrayToSort[j] = arrayToSort[j - num]; j-= num; arrayToSort[j] = key; radix bubble shell selection insertion quick