using table instead of recursion in we saw that the natural recursive program to compute the fibonacci numbers is very inefficient recall that the program shown in figure has running timet( )that satisfies ( > ( ( since (nsatisfies the same recurrence relation as the fibonacci numbers and has the same initial conditionst(nin fact grows at the same rate as the fibonacci numbers and is thus exponential on the other handsince to compute fn all that is needed is fn- and fn- we only need to record the two most recently computed fibonacci numbers this yields the (nalgorithm in figure /*compute fibonacci numbers as described in *long long fibint ifn < return else return fibn fibn )figure inefficient algorithm to compute fibonacci numbers /*compute fibonacci numbers as described in *long long fibonacciint ifn < return long long last long long last nexttolast long long answer forint < ++ answer last nexttolastnexttolast lastlast answerreturn answerfigure linear algorithm to compute fibonacci numbers