6. Mergesort A. Given the following array as input, illustrate how the Mergesort algorithm performs. To illustrate the Mergesort's behavior, start with the dividing of the array until the end condition of the recursive function is met and then show how the merge is performed 4 2 0 B. Given the function below, that divides the original array in two arrays of half size, develop the Java code that combines two sorted arrays. ?se the result from problem 6a) to develop that code. int middle values.length/2; // divide array into two arrays of half size int [] eft = new int [middle]; for (int i-0; i