Java code is giving: final static Scanner cin = new Scanner(System.in); public static void main(String[] args) { out.println("CPS 151 In-class assignment 3 by ___ your name here ___
"); out.print("Enter n: "); int n = cin.nextInt(); long f = fib(n); out.println("
fib(" + n + ") = " + f); out.println("
CPS 151 In-class assignment 3 complete"); } // end main // standard fibonacci number computation using recursion static long fib(int n) { if (n

Question

Java code is giving: final static Scanner cin = new Scanner(System.in); public static void main(String[] args) { out.println(&#34;CPS 151 In-class assignment 3 by ___ your name here ___
&#34;); out.print(&#34;Enter n: &#34;); int n = cin.nextInt(); long f = fib(n); out.println(&#34;
fib(&#34; + n + &#34;) = &#34; + f); out.println(&#34;
CPS 151 In-class assignment 3 complete&#34;); } // end main // standard fibonacci number computation using recursion static long fib(int n) { if (n < 0) terminate(&#34;Negative argument value not allowed, program ended&#34;); if (n <= 1) return n; else return fib(n - 1) + fib (n - 2); } // end fib private static void indent(int level) { for(int Lcv = 1; Lcv <= level; Lcv++) out.print(&#34; &#34;); } // end indent private static void terminate(String errorMessage) { out.println(errorMessage); System.exit(1); } // end terminate CPS 151BIn-class Assignment 3+ + 80%1 / 22022-09-08Self-tracing recursive methods (functions)In class we looked at having a recursive method trace itself to show the calls being made and the values being returnedfrom each call (with appropriate indentation). Your task is to add this capability to a recursive function calculatingFibonacci numbers.We can add a parameter to a recursive function to tell it what its depth of recursion is. The top level call is at depth (orlevel) 0. When a function executing at level k calls itself, that function call is at level k + 1. The trace messages arewritten to the standard output with an indentation proportional to the call level.I have given an example adding the self-tracing feature to a function computing n! (n factorial). See RecFact.java postedon Isidore. You are also provided with the code for a method computing the Fibonacci numbers.Your task is to modify the Fibonacci number computing program to add the self-tracing feature. See how it was done forthe factorial function, and do the same for the Fibonacci function.Note: Do not forget to have your name as comments in the Java source code. You should also edit the outputidentification line at the beginning of the main method to include your name.Submit the source code and screen shot in one document as before.Show the results for 5 as the input (as in the sample output).Note: Each function entry message should show the value of the parameter n. Each function exit message should showthe value of the parameter n, and the value of the function being returned, again suitably indented.Note: Both recursive calls within the code for function fib (with arguments n-1 and n-2) are made at the same recursionlevel (recursion depth) and it is 1 more than the level at function entry. Sample output from the finished program follows:unorOutput - ICA03_KEY (run) XADCPS 151 In-class assignment 3 byEnter n: 5Entering fib: n = 5Entering fib: n = 4Entering fib: n = 3Entering fib: n = 2Entering fib: n = 1Exiting fib: n = 1 return value = 1Entering fib: n = 0Exiting fib: n = 0 return value = 0Exiting fib: n = 2 return value = 1Entering fib: n = 1Exiting fib: n = 1 return value = 1Exiting fib: n = 3 return value = 2Entering fib: n = 2Entering fib: n = 1Exiting fib: n = 1 return value = 1Entering fib: n = 0Exiting fib: n = 0 return value - 0Exiting fib: n = 2 return value = 1Exiting fib: n = 4 return value - 3Entering fib: n = 3Entering fib: n = 2KEYEntering fib: n = 1Exiting fib: n = 1 return valueEntering fib: n = 0Exiting fib: n = 0 return value = 01Exiting fib: n 2 return valueEntering fib: n = 1Exiting fib: n = 1 return value = 1Exiting fib: n = 3 return value = 2Exiting fib: n = 5 return value = 5fib (5) = 5wSaterCPS 151 In-class assignment 3 completeBUILD SUCCESSFUL (total time: 11 seconds)X

Accepted Answer

Oh no! Our experts couldn't answer your question.

Don't worry! We won't leave you hanging. Plus, we're giving you back one question for the inconvenience.

Want to see the full answer?