Complete computefibonacci() to return fn, where f0 is 0, f1 is 1, f2 is 1, f3 is 2, f4 is 3, and continuing: fn is fn-1 + fn-2. hint: base cases are n == 0 and n == 1.

Fibonacci series is given by

f(0)=0, f(1)=1, f(2)=1, f(3)=2, f(4)=3

As you can see using the above result

f(4)=f(3) + f(2),

f(3)=f(2) + f(1),

f(2)=f(1) + f(0)

Proceeding using same pattern

f(5)=f(4) + f(3)=3+2=5

f(6)=f(4) + f(5)=3+5=8

f(7)=f(6) + f(5)=8+5=13

f(8)=f(7) + f(6)=13+8=21

f(9)=f(8) + f(7)= 21+13=34

f(10)=f(9) + f(8)=34+21=55

f(n-2)=f(n-3)  + f(n-4)

f(n-1)=f(n-2)+ f(n-3)

Similarly and finally we get using the same pattern we get, As given f(n)=f(n-1) + f(n-2).

1. 3.4/4

2. 0.8/7

3. 0.5 x 3

4. 0.9 x 6

5. 10.8

6. 2.35

7. 0.567

8. 9.35

9. 0.02

10. 0.06

11. 0.16

12. 0.42

13. 0.63

14. 5.6

15. 8.1

16. 9.9

17. 0.28

18. 0.48

19. 0.27

20. 0.49

21. 0.45

22. 0.72

23. 0.9

24. 0.88

25. 0.75

26. 0.16

27. 0.328

28. 0.495

29. 0.72

30. 1.068