For each of the following T(n), write the corresponding Big O time complexity. Some series may require I. (2 points) T(n) n2+3n+2 2. (2 points) T(n) (n2 + n)(n2 + 5) 1. 2. 3. (2 points) T(n) 1+2+3+.+n-1+ 3. 4(2 points) T(n) = 12+22 +3+. . . . + (n-1)2 + n2 4. 5. (2 points) T(n)-10 5. 6. (2 points) T(n)= 10100 6. 7. (2 points) T(n)= n + log n 8. (2 points) Fin-12 log(n) + 400 8. 9. (2 points) T(n) (n + 1) - log(n) 9. 10. (2 points) T(n) 10. Page I of 5 20 points