All right.
So let's look at the solution to implementing in a recursive Fibonacci sequence.
So remember, I said we needed our base cases of if the number equals zero, return zero,
if the num equals one, then we need to return one.
Otherwise we will say let in one equal to Fibonacci of num minus one and then let in two.
Equal Fibonacci of num minus two.
Because remember the answer to the next number in the sequence is the previous two numbers added together.
So now we have return in one plus and two.
Again, this is because we add the previous two numbers in the sequence together.
So now if we come down here and we print out
the Fibonacci for 15.
And if I do that correctly and we run, we get 610 returned as the answer.
Which is the correct answer.
So hopefully you got that exercise.
If you have any questions, please feel free to ask them in the Q&A section.