Can you explain these problems, please. Its for an algorithms class.

1. (25 pts) For each of the pairs of functions fand g given in the table below, determine if f(n)=0(g(n)), 2(g(n)), g(n), o(g(n), or w(g(n)) and justify your answers. More precisely, do the following for each pair of the given functions: - if you decide f(n) = (g(n))/(g(n)), then find a constant c>, where f(n) scg(n)/fin) cg(n) for all n21. - if you decide f(n) = (g(n)) / wg(n)), then show the limit of f(n)/g(n) is 0/-0, where n approaches - Conclude that f(n) = (g(n)) if you decide that f(n) is both O(g(n)) and 2(g(n)) f(n) 2n-1 n15 g(n) 100n n log n n3 n log (log n) n2 logn n log (n) 21 27-1