Suppose the exact time required for an algorithm A in both the best and worst cases is given by the function TA(n) = 280m2 + 42 log n + 1212 + 280 (a) (2 points) For each of the following statements, indicate whether the statement is true or false. 1. Algorithm A is O(log n) 2. Algorithm A is O(112) 3. Algorithm A is O() 4. Algorithm A is O(2") (b) (1 point) What is the time complexity of algorithm A in big-notation