discrete structures problems
1.Find a limit to show that x(In(x2))3 isO(x2). Simplify when possible to avoid doing more workthan you have to. You will need to use L'Hôpital's rule at leastonce.
2.Suppose that f is o(g). What is lim(f(n)/g(n)) as n? ??
3.Suppose that algorithm has run-time proportional to log n andtakes 1 millisecond to process an array of size 3,000. How manymilliseconds will it take to process an array of size27,000,000,000 ? Hint: what simple relationship is there betweenthe first number and the second number?
