Given the method mystery below, show all output printed for the method call mystery(test), where test is the array [15, 20, 25, 30]. Write down JUST the output. public static void systery(int[] arr) { int total = 0; int index = 0; } while (total < 100) ( try ( } int value are[Index]; total index + 2; System.out.println(total); } catch } value; (ArrayIndexOutOfBoundsException e) ( index index-3; System.out.println("done"); Part B The Quick Sort algorithm is an efficient way to sort an array. Similar to Merge Sort, it uses recursion to take a divide-and-conquer approach. The basic steps is as follows: 1. If the array has 1 or less elements, do nothing. 2. Choose an element from the list, called the pivot. This will be used to divide the list into two sub- lists. 3. Reorder all the elements around the pivot the ones with smaller value are placed before it, and all the elements greater than the pivot after it. After this step, the pivot is in its final position. 4. Create two sub-lists on the left and right of the pivot. Apply the above steps recursively to both sub-lists. Assume that you are given the method below that creates the partitions mentioned in step 3 and returns the pivot in it's optimal position. private int partition(int arr[], int begin, int end) Write the recursive method quickSort as described in step 1, 2 and 4. Use the method above to get a pivot value and call the quickSort method recursively on the two sub-arrays generated from [0 to pivot] and [pivot+1 to arr.length-1]. public void quicksort(int arr[], int begin, int end)