quicksort

i dont want the code. i want explanation only

Consider QuickSort on the aray A[l:n] and assume that the pivot element x (used to split e array A[lo:hi] into two portions such that all elements in the left portion A[lo:m] are Sx ght portion A[m:hi] are 2x) is the last element of the array to be split and all elements in the ri For a specific value of n at least 13 (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 Am:hi] are always of equal size) (b) execute in the slowest possible way