For the average run time recurrence a(n) for quicksort given below, tabulate the values for n= 100, 2000, 3000, ..., 100,000.

is the run time of this algorithm 5) For the average run time recurrence a(n) for quicksort given below, tabulate the values for n 1000, 2000, 3000..., 100, 000. a(0) a(1)-0, and a(n)-n-1 + %; a(i). Since we have argued that a(n) A C n log2 n, look at the table and estimate C. 2 wn-1 i2 a(a) is the run time of this algorithm 5) For the average run time recurrence a(n) for quicksort given below, tabulate the values for n 1000, 2000, 3000..., 100, 000. a(0) a(1)-0, and a(n)-n-1 + %; a(i). Since we have argued that a(n) A C n log2 n, look at the table and estimate C. 2 wn-1 i2 a(a)