11.12 LAB: Fibonacci sequence (recursion) The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete the Fibonacci() function, which takes in an index, n, and returns the nth value in the sequence. Any negative index values should return -1. Ex: If the input is: 7 the output is: Fibonacci (7) is 13 Note: Use recursion and DO NOT use any loops.

c++ Language I need help with question #6 part c please. **WITHOUT "DP" please. I keep getting dp in the answers from you guys and it's very confusing and i can't use that please. Don't use "DP" please and thank you so much. I asked this question 3 times but i keep getting programs im not able to run. Please make it as simple as possible for me thank you so so much. I did a and b already, i just need with c using dynamic programming. Please and thanks!

Please help, I need the code in C language I'm struggling.

Please I need help to get this homework done, I am not sure how to build the program correctly.