Question $2$

$2$ pts

$($Select all that apply$)$ For some constant $c$ and recurrence $q=1O(n)q=2O(nlogn)q>2q>10O(n^{2}logn)T(n)$ which $of$ the following $is$ true?

When $q=1$ the run time $isO(n).$

When $q=2$ the runtime $isO(nlogn).$

When $q>2$ the runtime $is$ polynomial with $an$ exponent larger than $1$ which grows with $q.$

When $q>10$ the recurrence $is$ bounded $byO(n^{2}logn)$