ignore the first question's answer, thank you!

What are the tightest bounds for the functions T and T (respectively from left to right) such that T1 (n) = n( ) T, (n) = T2 (n-4) + cn O O(n), O(n logn) O O(n), O(n) O(n logn), O(n logn) O(n), O(n^2) What is the tightest bound for the function T such that: T(n) = 10T(3) + n2 login The "Regularity Condition" doesn't hold, so the Master Theorem is not applicable nlog n n logn