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

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 Fibint n) { if (n <1) return n; Fib(n-1) Fib(n-2); return + } 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: O(2^n) and DP: Theta(n) Recursive O(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 Fibint 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 algorithm to… . . .