JAVA PROGRAMMING

Question 1:

For each of the following T(n), write the corresponding Big O time complexity. Some series may require research.

T(n) = n + 3n + 2 T(n) = (n + n)(n2 + 3 T(n) =1+2+3+...+ n - 1+m T(n) = 12 + 22 + 32 + ... + (n 1)2 +n2 T(n) = 10 T(n) = 10100 T(n) = n + log n T(n) = 12 log(n) + " - 400 T(n) = (n + 1) log(n) n T(n) = n +3mv2n