solve just the number 3 real quick for this problem using java language

 

S since the algorithm computes each Fibonacci number, numerous times. The algorithm is inefficient because it has too many recursive calls. However, memoization offers a better solution by eliminating the repetitive calls that occur in the reduced cases, since the values are computed once then stored. It is not recommended to use the general algorithm for computing the nth Fibonacci number in the Fibonacci Sequence, since it repeats so many of its calls. For example, the number of recursive calls needed to compute fib(40) in the general algorithm is around 331 million, many of which are unnecessary. Instructions: Write different versions of the algorithm for computing the nth Fibonacci number in the Fibonacci Sequence according to the tasks list below. The Fibonacci sequence/series is a mathematical model that is often used in numeric optimization. It is based on a sequence of numbers in which the first two numbers in the series are 0 and 1, and each subsequent number is the sum of the previous two numbers. 0 1 2 3 4 5 6 7 8 9... value: 0 1 1 2 3 5 8 13 21 34... n Where to find starter code in my-api package.class: modules. FibModule package.class: tests.console.week06.Fibonacci Test Task Lists 1. Implement the recursive method fib(n) the nth Fibonacci number in the Fibonacci Sequence. This should be the general algorithm of the Fibonacci Sequence in its basic form. 2. The code in 1 may be inefficient, because it takes too many recursive calls. Write a new version of the Fibonacci method mfib(n) that is still recursive but is more efficient than the one in 1. Do this by creating a helper method memo that accepts an additional parameter, the storage for the previous Fibonacci numbers, that you can carry through and modify during each recursive call. 3. Write a new version of the Fibonacci method ifib(n) that uses iteration to generate the result for the nth value in the Fibonacci sequence.