Consider the following recursive implementation to find the nth fibonacci number:

int fibo(int n)
{
     if(n == 1)
        return 0;
     else if(n == 2)
        return 1;
     return ________;
}
int main()
{
     int n = 5;
     int ans = fibo(n);
     printf("%d",ans);
     return 0;
}

Which of the following lines should be inserted to complete the above code?

A. fibo(n - 1)

B. fibo(n - 1) + fibo(n - 2)

C. fibo(n) + fibo(n - 1)

D. fibo(n - 2) + fibo(n - 1)

Answer: Option B