Question: need help with JAVA 1. Consider the following recursive method: Public static int Fib(int a1, int a2, int n){ if (n=1) return al ; else
1. Consider the following recursive method: Public static int Fib(int a1, int a2, int n){ if (n=1) return al ; else if (n=2) else return a2: return Fib(a1, a2, n-1) + Fib(a1, a2, n-2); 3 Please draw the recursion trace for Fib (2,3,5)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
