I need to solve this in MATLAB.

Problem Summary The Fibonacci sequence is fib 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, where the Nth term, is given by Write a function that accepts a single scalar input, N, and computes the Nth term of the sequence. (It should call recursive fibonacci to calculate earlier terms.) Each time your function assigns a value to F, save this value in ASCII format to the data file recursion_check.dat". Be sure to use the -append option so the file is not overwritten with each save. The test suite will examine this file to check the stack and ensure you have solved the problem using recursion. #FILE