Java Quicksort and analysis question

3. Consider QuickSort on the array All:n] and assume that the pivot element x (used to split the array A[lo:hi] into two portions such that all elements in the left portion A[lo:m] are Sx and all elements in the right portion Alm:hi] are 2x) is the last element of the array to be split For a specific value of n at least 11 (your choice), construct an assignment of the numbers 1.. .n to the n array elements that causes QuickSort, with the stated choice of pivot, to (a) execute optimally (that is A[lo:m] and A[m:hi] are always of equal size) (b) execute in the slowest possible way