c++ code

A. Using big-O notation to solve the asymptotic behavior of the following functions i. Ta(n) = n2 + 100nlogn + 10n + 1000 ii. Td(n) = 49+1+16n16 B. Solve the worst case time complexity of the following procedure as a function of n by using "Big-Oh" notation. Show all the steps of calculation. int i = 0; while (i = 0) 1 for (int j - 0; j i; j--) // loop 2 for (int k = n; k > j; k--) // loop 3 System.out.println("*")<>