[solved]-Terms Fibonacci Sequence Given F1 1 F2 1 Fn Fn 1 Fn 2 Consider Following Recursive Algorit Q39057318

answer & explain

The terms in the Fibonacci sequence are given by : F1 = 1, F2 = 1; Fn = Fn-1 + Fn-2 Consider the following recursive algorithm to calculate the nth Fibonacci number. int Fibc int n) if (n <= 1) return n; return Fib(n-1) + Fib(n-2); What is the running time of the recursive Fib? What is the running time of an efficient DP algorithm to calculate the nth Fibonacci number? Both algorithms are O(n) Recursive: O(n^2) and DP : O(n) Recursive: Theta(2^n) and DP : Theta(n^2) Recursive: 0(2^n) and DP: Theta (n) Recursive 0(4^n) and DP: O(Ign) Show transcribed image text The terms in the Fibonacci sequence are given by : F1 = 1, F2 = 1; Fn = Fn-1 + Fn-2 Consider the following recursive algorithm to calculate the nth Fibonacci number. int Fibc int n) if (n

Expert Answer

---

Answer to The terms in the Fibonacci sequence are given by : F1 = 1, F2 = 1; Fn = Fn-1 + Fn-2 Consider the following recursive alg… . . .