Suppose the exact time required for an algorithm A in both the best and worst cases is given by the function TA(n) = n +42logn+12n +280n 1 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. Algoirthm A is O(n) 3. Algoirthm A is O(n) 4. Algoirthm A is O(2) (b) (1 point) Can the time complexity of this algorithm be expressed using big-O notation? If so, what is it?