When does the best case runtime in quicksort occur? a. When values are sorted b When values are not sorted c. When the pivot is selected at random d. All of the above e. None of the above 1. What is the last value of this array after the first partitioning of the array using quicksort (select the last value as the pivot)? 101,125,126,186.58,61,75,96,82,55,119 2. 10112512058 180 a. 119 b.125 186 d.101 e. None of the above For questions 3-6, solve each recurrence, and choose the option (a-e) that is the solution as a simplest function of n orf if it is not listed. b. 0(n) c. (n log n) e. e(n3) f. None of the above 3. T(n) -27 T(n/3)+ n3 4. T(n) 256 T(n/4)+n 5. T(n) 8 T(n/2 +15)+ n 6. T(n) T(n-1)+ n a. C. a. C. 7. Provide the formal definition of 0 notation