Suppose the exact time required for an algorithm A is given by the function

TA(n) = 280n + (log₂n)21n^2.5+12n³ +101+42n

(a) (2 points) Which of the following statements are true?

1. Algorithm A is O(logn)

2. Algoirthm A is O(n)

3. Algoirthm A is O(n3)

4. Algoirthm A is O(2n)

(b) (1 point) Give the correct time complexity for A in big- notation.