Java: f(n) and g(n) does not matter

n nlog(n)

n^2 2^n

(2^n)*log(n) (log(n))^5

From the three pairs of consecutive terms, f(n) and g(n), and, for each pair, carefully use the definition of Big-Oh to prove that f(n) = O(g(n)). Selecting values of c and n₀ is part of this but not the entire proof!

(c) Last, pick any three terms listed above and, for each, show a block of code that has that run time (in terms of input n or an array of size n, your choice).