1.	/* Fig. 5.15: fig05_15.c
2.	recursive Fibonacci function*/
3.	#include <stdio.h>
4.	 
5.	long fibonacci (long n);	/*function prototype*/
6.	int main (){
7.	long result; 
8.	long number;
9.	 
10.	printf (“enter and integer:”);
11.	scanf (“%d, &number);
12.	 
13.	 result = Fibonacci(number);
14.	 
15.	printf (“finbonacci(%1d) = %1d\n”, number, result);
16.	 
17.	 return 0;
18.	}