Iterative Fibonacci

Iterative Fibonacci 3 (while loop, perils of integer arithmentic) D 0 solutions submitted (maxc Unlimited) The Fibonacci sequence defined by fib-1, 1, 2, 3, 5, 8,13, 21, 34, 55, 89,.. where the Nth term, is given by Fs = FN-1 + FN-2 As N increases, the ratio or two adjacent terms in the sequence approaches The Golden Ratio, ?. Write a function that accepts a single input that is the tolerance, TolGR for the Golden Ratio calculation. Use a while loop to generate Fibonacc numbers until the error in subsequent calculations of .defined by is less than or equal to TolGR Your function should output three scalar values. order 1. The tinal value of the Golden Ratio 2. The largest Fibonacci number generated 3. The number of terms, N, required to meet the tolerance Your Function C Reset MATLAB Documentation function [GoldenRatio, LastFib, NumTerns] student_solution TolGR) 3%irite the commands for your function here. You can change the names, but not the order, of the input and/or output variables in the function command to match your code. Do not change the name of 1: LastFib-1; NunTerms1; end