Can I get help with this in Java please? Thank you. Given the following numbers, sort it using quick sort technique. The pivot selection must be thetechnique we learned in class.35 20200 2585 35 4055 45 501. a) show the first partition showing the pivot and the other two sub-arrays.2. b) show the partitions of the fırst sub-array with its pivot.3. c) show the partitions of the second sub-array with its pivot

Algorithm 1.We choose an element from the list, called the pivot. We'll use it to divide the list into two sub-lists. 2.All the items around the pivot are reordered - the ones with lower value go before it, while the ones with higher values go after it. The pivot is now in its final position after this step. This is the crucial phase in the partitioning process. 3.The aforementioned procedures are repeated for both the left and right sub-lists of the pivot. A pivot value can be any of the following: The first element in the array The last element in the array The mid element in the array Any random element in the array code public void quickSort(int arr[], int begin, int end) { if (begin < end) { int partitionIndex = partition(arr, begin, end); quickSort(arr, begin, partitionIndex-1); quickSort(arr, partitionIndex+1, end); } } private int partition(int arr[], int begin, int end) { int pivot = arr[end]; int i = (begin-1); for (int j = begin; j < end; j++) { if (arr[j] <= pivot) { i++; int swapTemp = arr[i]; arr[i] = arr[j]; arr[j] = swapTemp; } } int swapTemp = arr[i+1]; arr[i+1] = arr[end]; arr[end] = swapTemp; return i+1; }