this is from Algorithm class. no need for coding.

3. Consider Quick Sort on the array A[1: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 Allo:m) are & and all elements in the right portion A[m:hi) are >x) is the last element of the array to be split (i. e., A[hi]). 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