**Required Work**

Show your work by showing how many recursive calls with beexecuted and show the input and output of each recursive call. Whatis the final method output?

SCORE YOUR POINTS BY TRACING EACH RECURSIVE CALL AND GIVE THEFINAL RESULT IN THE SPACE BELOW:

**Part 2. Implementing recursive Fibonacci Method (8pts)**

In this part of the lab, you are asked to write recursive Javacode to implement Fibonacci function. Fibonacci function is definedas:

fib( 1 ) = 1 (base case)

fib( 2 ) = 1 (base case)

fib( n ) = fib( n-1 ) + fib( n-2 )

**Required Work**

Write a Java class called *RecursiveDriver* that includesa main() method. In the class, write a static recursive methodcalled *fibonacci* that implements the above Fibonaccifunction.

SUPPLY JAVA SOURCE CODE FOR CLASS RECURSIVEDRIVER IN THE SPACEBELOW TO SCORE YOUR POINTS (4 pts):

**Answer:**

**2. Do an output screen capture. After successfully wrotethe required code, run the program in Eclipse (input n=33). Then,either transcript the outputs from the Eclipse output consolewindow or do a screen capture of the output window in the spacebelow (your output should prove that your implementation iscorrect).**

SUPPLY THE RUN OUTPUT IN THE SPACE BELOW TO SCORE YOUR POINTS (4pts):

**Answer:**

C Get Homework Help With Cheg x + gra x t/4588148/fullscreen/40751542/View icloud Storage is Full Photos, videos, documents, and data are no longer updating Manage Upgrade The Problem Statement In this lab section, you are going to practice on recursion algorithms. We are going to divide the work into several parts. Part 1. Tracing Recursive Method (7 pts) WITHOUT using the computer, find the output of the following method when n 3. public static int mystery(int n){ if (n =0) return 0; else return n*n mystery(n-1); } Show transcribed image text C Get Homework Help With Cheg x + gra x t/4588148/fullscreen/40751542/View icloud Storage is Full Photos, videos, documents, and data are no longer updating Manage Upgrade The Problem Statement In this lab section, you are going to practice on recursion algorithms. We are going to divide the work into several parts. Part 1. Tracing Recursive Method (7 pts) WITHOUT using the computer, find the output of the following method when n 3. public static int mystery(int n){ if (n =0) return 0; else return n*n mystery(n-1); }

## Expert Answer

Answer to Required Work Show your work by showing how many recursive calls with be executed and show the input and output of each…