Whats the result if N = 5? I dont understand recursion. Can you also show me the steps? Thanks in Advance!

int Fibonacci(int N)

{

if ((N == 1) || (N == 2)) // base cases

return(1);

else // recursive cases

return(Fibonacci(N - 1) + Fibonacci(N - 2));

}