19.2. Write a recursive function that returns n'th Fibonacci number.

#include<stdio.h>
#include<conio.h>
long Fibo(int n)

{
if (n==0)
return 0;
if (n==1)
return 1;

}
return Fibo(n-1)+Fibo(n-2);

}
void main ()

{
int n;
clrscr();
printf("Enter any positive integer: ");
scanf ("%d", &n);
printf("%d'th Fibonacci number is %ld",n,Fibo (n));
getch();

}