Recursive Fibonacci Generator $($simple recursion$)$

The Fibonacci sequence is defined by

$F=1,1,2,3,5,8,13,21,34,55,89,$dots

where the $k^{th}$ term is given by

$F_k=F_{k-1}+F_{k-2}$

Write a function named recursiveFibonacci that accepts a single scalar input, $N,$ and uses recursion to compute the $N^{th}$ term of the sequence.

Use recursion to solve this problem and not the MATLAB fibonacci function. The tests will check that you did not use any for or while loop or fibonacci.

Note the function command is given in line $1$ with suggested names for the input and output variables. You can change the names $($but not the order$)$ of these variables if you like.

Do not change the name of the function, however, as this exact name is required for the tests to run. Be sure to assign a value to the output variable.