10. Which of the following is the recurrence equation for the worst case time complexity of the quick sort algorithm for sorting n (> 2) numbers ? where c is a constant A. T(n) = 2T(n/2) + cn B. T(n)...

Extracted text: 10. Which of the following is the recurrence equation for the worst case time complexity of the quick sort algorithm for sorting n (> 2) numbers ? where c is a constant A. T(n) = 2T(n/2) + cn B. T(n) = T(n/2) + cn С. Тп) — 2Т(п - 2) + сп D. T(n) = T(n-1) + T(1) + cn %3D