Procedure 6.10 (Fibonacci Sequence (recursive way) )

Before seeing the solution make sure that you tried enough. Don’t paste the whole code, just find out the logic. If you stuck in trouble, just inform me on comment.

/**Bismillahir Rahmanir Rahim**/

#include <stdio.h>

int fib(int n)
{
    if(n == 0) return 1;
    if(n == 1) return 1;
    return fib(n-1)+fib(n-2);

}
int main()
{
    int n, m;
    printf("Input a number (less than 40)\n");
    scanf("%d", &n);
    m = fib(n);
    printf("The %dth fibonakki is %d\n", n, m);
    return 0;
}