Can I have help with these 4 questions please? thanks!

1. Characterize the following algorithm in terms of Big-O notation. (Assume that all variables are properly declared.) for (int i = 1; i <= 2 * n; i++) for (int j = 1; j <= n; j++) cout << 2 * i + j; cout << endl;

2.Characterize the following algorithm in terms of Big-O notation. Also find the exact number of additions executed by the loop. (Assume that all variables are properly declared.) for (int i = 1; i <= n; i++) sum = sum + i * (i + 1)

3.In the software maintenance process, the program is modified to fix the (identified) problems and/or to enhance it.

TRUE OR FALSE

4.If g(n) = 1, the growth rate is constant and does not depend on the size of the problem.

TRUE OR FALSE