b) Write a recursive function to obtain the first 25 numbers of a Fibonacci sequence. In a Fibonacci sequence the sum of two successive terms gives the third term. Following are the first few terms of the Fibonacci sequence:
1 1 2 3 5 8 13 21 34 55 89.....Write a recursive function to obtain the first 25 numbers of a Fibonacci sequence.
in C and CPP
