The worst case performance for quicksort comes from the relation T$($n$)=$ T$($n$-1)+$n$.$ You want to use the substitution method to prove that T$($n$)=\backslash$Theta $($n$^2).$ Plugging in Cn$^2$:

A$.$ The largest value of C that doesn't work for the O$($n$^2)$ proof is $\_\_\_.$

B$.$ The largest value of C that does work for the $\backslash$Omega $($n$^2)$ proof is $\_\_\_.$