Write a program to find the nth term in the Fibonocci series using recursion.
Note that the first 2 terms in the Fibonocci Series are 0 and 1.
Answers
Answered by
1
Answer:
INPUT & OUTPUT FORMAT:
Input consists of an integer.
Refer sample input and output for formatting specifications.
All text in bold corresponds to the input and the rest corresponds to output.
SAMPLE INPUT & OUTPUT:
Similar questions