Algorithm

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