Suppose, in the Quicksort algorithm, you magically can determine a pivot which partitions the data in the ratio 1:2. What would the recurrence relation be?

Group of answer choices

T(n) = T(n-1) + (n)

T(n) = 3 T(n/3) + (n)

T(n) = T(2n/3) + T(n/3) + (n)

T(n) = T(n/2) + T(n/3) + (n)

Suppose, in the Quicksort algorithm, you magically can determine a pivot which partitions the data in the ratio - 1:2. What would the recurrence relation be? 0 (n) = T(n-1) + V (n) 0 T(n) = 3 Tn/3) + e (n) T(n) = T(2n/3) + T(n/3) + (n) 0 T(n) = Tn/2) + Tn/3) + O (n)