The Quick Sort Algorithm has the following Recurrence relation and time complexity in its worst$-$case:

$T(n)=T(n-1)+n^2+n>1$

$T(1)=1$

$T(n)=O(nlogn)$

$T(n)=2T(n-1)+n,n>1$

$T(1)=1$

$T(n)=O(n^{2}logn)$

$T(n)=T(n-1)+n,n>1$

$T(1)=1$

$T(n)=O(n^2)$

$T(n)=T(\frac{n}{2})+n,n>1$

$T(1)=1$

$T(n)=O(n^2)$