Running Time Analysis: Give the tightest possible upper bound for the worst case running time for each of the following in terms of N. You MUST choose your answer from the following (not given in any...

Running Time Analysis: Give the tightest possible upper bound for the worst

case running time for each of the following in terms of N. You MUST choose your

answer from the following (not given in any particular order), each of which could be reused

(could be the answer for more than one of a) – f)):

O(N2), O(N3 log N), O(N log N), O(N), O(N2 log N), O(N5), O(2N), O(N3),

O(log N), O(1), O(N4), O(NN), O(N6)