Question

Given F(0) =1 and F(1) = 1. Then write a function to find F(n), Where F(n) = F(n-1) + F(n-2). Ask students to generate a Fibonacci series

Answer 1

int F(int n)

{

if (n==0|| n==1)

return (1);

else

return(F(n-2)+F(n-1));

}

hope it helps:)

plz mark brainliest.