4. For each of the functions f00) given below, indicate the tightest bound possible (in other words, giving O(2) as the answer to every question is not likely to result in many points). Unless otherwise specified, all logs are base 2. You MUST choose your answer from the following (not given in any particular order), each of which could be re-used (could be the answer for more than one of a) -h) ON), O(N’ log N).
OR
OR