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
OR
OR