Discrete Mathematics Problem:

(a) Suppose the complexity of an algorith!n is given by /(n) 4 + 2n (log (n2))2 3n Determine the tightest O and bounds that you can for this algorithm. Can you conclude anything about the order () of this algorithm? (b) Find the tightest O and bounds that you can for the function h(n) n log(n5) 3m2 (c) Show that g(n) = log (log n) is O(log n)