You can assume that all recurrence relations are non-decreasing. You can omit floor and ceiling rounding in vour expressions The partition(A, lo, hi, pivot) function used in this assignment works as follows. Denote by x the value of A [pivot] before the call to partition, and denote by newpivot the return value of partition The call to partition re-arranges the elements of A[lo,. . . ,hi] so that: * all the elements of A[lo,... ,newpivot-1] are