What is recurrence for worst case of QuickSort and what is the time complexity in Worst case?

A | Recurrence is T(n) = T(n-2) + O(n) and time complexity is O(n^2) |

B | Recurrence is T(n) = T(n-1) + O(n) and time complexity is O(n^2) |

C | Recurrence is T(n) = 2T(n/2) + O(n) and time complexity is O(nLogn) |

D | Recurrence is T(n) = T(n/10) + T(9n/10) + O(n) and time complexity is O(nLogn) |