Question 2:(1+3+6=10 points ) We present another asymptotic notation that is used in the analysis of algorithms: For functions f,g, we say f=o(g) (" f is little-o of g") if and only if the ratio g(n)f(n) goes to zero as n tends to infinity. For example, logn=o(n) but n=o(n). 1. Is n=o(n) ? Briefly explain why. 2. Is it possible that f=o(g) and g=O(f) ? If yes, give an example. Otherwise prove that it is not possible