Assume L is an array, length(L) returns the number of records in the array, and qsort(L, i, j) sorts the records of L from i to j (leaving the records sorted in L) using the Quicksort algorithm. What is the averagecase time complexity for each of the following code fragments?

(a) for (i=0; i

(b) for (i=0; i