Understand the complexity of algorithms.

Find the c and N for the function g so that f(n) = O(g(n)).

1) f(n) = 4n² + 3n + 6, g(n) = n²

2) f(n) = 3n² + 2n + 8, g(n) = n³

3) f(n) = n² + 4n, g(n) = n²

4) f(n) = 1000 n + 2000, g(n) = n

5) f(n) = 1000 n + 2000, g(n) = n²

6) f(n) = 1000 n + 2000, g(n) = n³

7) f(n) = 10 n³ + 2 n² + 5 n, g(n) = n³

8) f(n) = n³ + 6n + 54, g(n) = n³

9) f(n) = 1000 n² + 2000 n, g(n) = n³

10) f(n) = 1000 n² + 2000, g(n) = n³