1. Profession that the character log2(9N) is O(log2N). You conquer demand to verification the determination of O(f(n)) to do this. In other words, meet values coercion c and n0 such that the determination of Big Oh holds penny as we did with the stance in exhortation. Coercion bountiful faith, profession steps you took to enter at you c and n0.
Big O notation confine a character from over singly, that is a character f(n) is said to be O(g(n)) if coercion n>n0 (n0 is a true) there exists a true c such that 0 <= f(n) <= c*g(n).
Best method to meet the values of c and n0 is to devise the characters and tally the values!
Consider cethcoming graph:
The graph professions that coercion c = 10, and n0 = 3, 0 <= log^2(9N) <= 10*(log^2(N))