For each of the following f(n) functions derive the largest Big Omega, (g(n)), inequality and state whether your inequality is true for all values of n, or not:

1) n 3 + 25

2) 5n (c) 100n + n 2

3) 100n + n 2

4) 5n 3

5) n 2 + 3

6) nlogn