whats T(n) of the QuickSort algorithm in (1) the best case, (2) the worst case and (3) the case where the partition() algorithm always splits the input array with a 40:60 ratio (i.e., 40% of data goes in one partition and the remaining 60% the other)? algorithm quicksort(A, lo, hi) if lo < hi then p := partition(A, lo, hi) quicksort(A, lo, p - 1 ) quicksort(A, p + 1, hi) algorithm partition(A, lo, hi) pivot := A[hi] i := lo - 1 for j := lo to hi - 1 do if A[j] < pivot then i := i + 1 swap A[i] with A[j] if A[hi] < A[i + 1] then swap A[i + 1] with A[hi] return i + 1