Analysis of Algorithms question. Use C++ to finish this question, you need to answer d and e

6. Consider the Fibonacci numbers: F(n) = F(n 1) + F(n 2), n > 1; F(0) = 0; F(1) = 1. a). Write a recursive function to compute F(n) using the above definition directly. Imple- ment your solution and print F(i* 5), where 0 1; F(0) = 0; F(1) = 1. a). Write a recursive function to compute F(n) using the above definition directly. Imple- ment your solution and print F(i* 5), where 0