function [ fn ] = FibonacciR( n )
%FibonacciR Compute the n^th Fibonacci number
%   Use recursive programing. Input = n, 
%       output = the n^th Fibonacci number

if n == 1 
fn = 1;
elseif n ==2 
fn = 1;
else
fn = FibonacciR(n-1)+FibonacciR(n-2);
end

end