[Solved]8 Fibonacci Series Denoted F F F 1 4 Points Naive Recursive Algorithm Compute Fibonacci Nu Q37225951

8. The Fibonacci series is denoted F+ F+F-1- ) (a) (4 points) A naive recursive algorithm to compute the Fibonacci numbers has the recurrence rela- tion T(n) = T(n-1) +T(n-2) + 1 with boundary conditions T(0)-T(1)-1. The substitution method for this recurrence gave the solution T(n) 2+1-1. Prove it by induction. b)(2 points) Give with explanation the upper-bound for the following Dynamic Programming algo- rithm for computing Fibonacci numbers, where F is an array for storing subproblem results. o (n for i = 2..n do return FIn Show transcribed image text 8. The Fibonacci series is denoted F+ F+F-1- ) (a) (4 points) A naive recursive algorithm to compute the Fibonacci numbers has the recurrence rela- tion T(n) = T(n-1) +T(n-2) + 1 with boundary conditions T(0)-T(1)-1. The substitution method for this recurrence gave the solution T(n) 2+1-1. Prove it by induction. b)(2 points) Give with explanation the upper-bound for the following Dynamic Programming algo- rithm for computing Fibonacci numbers, where F is an array for storing subproblem results. o (n for i = 2..n do return FIn

Expert Answer

---

Answer to 8. The Fibonacci series is denoted F+ F+F-1- ) (a) (4 points) A naive recursive algorithm to compute the Fibonacci numbe… . . .