Objectives
• understand the complexity of algorithms.
find the c and n for the function g so that f(n) = 0(g(
1. f(n) = 4n2 + 3n + 6, g(n) = n2
2. f(n) = 3n2 + 2n +8, g(n) = n3
3. f(n) = n2 + 4n , g(n) = n2
4. f(n) = 1000 n + 2000,g(n) = n
5. f(n) = 1000 n + 2000,g(n) = n2
6. f(n) = 1000 n + 2000,g(n) = n3
7. f(n) = 10 n3 + 2 n2 +5n, g(n) = n3
8. f(n) = n3 + 6n + 54,9(n) = n3
9. f(n) = 1000 n2 + 2000 n, g(n) = n3
10. f(n) = 1000 n2 + 2000, g(n) = n3
upload your answers into the d2l in a zip file.