The N-th Fibonacci number is defined as the (N-1)th Fibonacci number + (N-2)th Fibonacci number, or more concisely:

fib(n) = fib(n-1) + fib(n-2);

In MATLAB terms, it would be:

 function result = fib(n) result = fib(n-1) + fib(n-2); end 

This is called recursion, because the function is calling itself in order to produce an answer. However, as written, the above 'fib()' function will never stop. In order for it to stop, a 'base case' is required. This is the case where the recursion stops. Write the code for the Fibonacci base case:

 function result = fib(n) [insert base case code here] result = fib(n-1) + fib(n-2); end