If we run the deterministic Quicksort (as described on page171) on input A[1 n] = 1, 2, 3, , n, what is the running time? Use notation.

7.1 Description of quicksort Combine: Because the subarrays are already sorted, no work is needed to combine them: the entire array AIp .rl is now sorted. The following procedure implements quicksort: QUICKSORTOA, p, r) l if p