+1 (218) 451-4151
glass
pen
clip
papers
heaphones

Consider the following “justification” that the Fibonacci function, F(n) is O(n): Base case (n…

Consider the following “justification” that the Fibonacci function, F(n) is O(n): Base case (n…

Consider the following “justification” that the Fibonacci function, F(n) is O(n): Base case (n ≤ 2): F(1) = 1 and F(2) = 2. Induction step (n > 2): Assume claim true for n′ What is wrong with this “justification”?Exercise R-4.16Show that if d(n) is O(f(n)) and e(n) is O(g(n)), then d(n) + e(n) is O(f(n) + g(n)).