For each of the functions f(N) given below, indicate the tightest bound possible (in other words, write the Big-Oh notation in terms of the variable n for the function as the answer to every question. Show the working where necessary. i. ii. iii. f(N) = N * (N2 log N + N2) f(N) = N log (1003) f(N) = (N3 + 2N2) / N f(N) = N2 + N2 + (N2 + 2N)3 f(N) = log N4 + log2 N f(N) = N3 * (NlogN 400log N) + (N2)2 iv. V. vi