Choose the recursive formula for the Fibonacci series.(n>=1)
(F(n) = F(n+1) + F(n+2))
(F(n) = F(n) + F(n+1))
(F(n) = F(n-1) + F(n-2))
(F(n) = F(n-1) - F(n-2))
(C) (F(n) = F(n-1) + F(n-2))
Explanation:
None.
