I have just started studying about recursion and wanted to implement the Fibonacci sequence problem.

Here, I am trying to find the nth number in the Fibonacci sequence. The code snippet is as below:

```
int static fibonacciRecursion(int n) {
if(n == 1 || n == 0)
return n; // or return 1; line of concern
else
return fibonacciRecursion(n-1) + fibonacciRecursion(n-2);
}
```

I am confused at the return statement of base condition. Should it be

`return n;`

or

`return 1;`

Also, I find it hard to come up with the structure of recursive solutions to problems.

Is there any specific way of approaching them?

What are your experiences?

Any specific resources that helped?

Thanks in advance!