Show your complete work when comparing the following function pairs. Provide the C and k values in the formal definition when asserting a big O,, or relationship (e.g. f(n) is O(g(n)) if there exists C>0 and k0 such that f(n)Cg(n) for all nk) Note: We are looking for both big O and . For example, if you prove that f(n)= O(g(n)) you should still explain whether or not f(n)=(g(n)). (i) log24n2 vs. log10n12 (ii) (n2) vs. n2/logn (iii) 4n vs. 42n