This is from Algorithm's class. Just need the algorithm, not code:

no need for conplete steps. just be as brief as possible.

3. Consider QuickSort on the array A[1:n) and assume that the pivot element x (used to split the array Alo:hi] into two portions such that all elements in the left portion A[lo:m] are x) is the first element of the array to be split (i. e., A[lo]). 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 A[m:hi] are always of equal size) (b) execute in the slowest possible way