Give the recursion Java code needed to produce thefollowing result when the user enters 11.
Enter n: 11
fib(1) = 1
fib(2) = 1
fib(3) = fib(2) + fib(1) = 2
fib(4) = fib(3) + fib(2) = 3
fib(5) = fib(4) + fib(3) = 5
fib(6) = fib(5) + fib(4) = 8
fib(7) = fib(6) + fib(5) = 13
fib(8) = fib(7) + fib(6) = 21
fib(9) = fib(8) + fib(7) = 34
fib(10) = fib(9) + fib(8) = 55
fib(11) = fib(10) + fib(9) = 89
Done
Expert Answer
An answer will be send to you shortly. . . . .