3. Which one of the following is the recurrence equation for the worst case time complexity of the Quicksort algorithm for sorting n(2 2) numbers? In the recurrence equations given in the options...

3

DO NOT COPY FROM OTHER WEBSITES

Correct and detailed answer will be Upvoted else downvoted. Thank you!

Extracted text: 3. Which one of the following is the recurrence equation for the worst case time complexity of the Quicksort algorithm for sorting n(2 2) numbers? In the recurrence equations given in the options below, c is a constant T(n)=2T(n/2)+cn T(n)=T(n-1)+T(1)+cn T(n)=2T(n-1)+cn T(n)=T(n/2)+cn