acing the Recursion. Observe the recursive solution provided below and answer the following questions: 1. Which line(s) of this program define(s) the base case of the binary() method? 2. Which line(s) of this program include recursive call(s)? 3. Trace the recursion below. You must show the tracing step by step (write them down); otherwise – little to no credit! 4. At what step of your recursion tracing did you hit the base case? 5. What is the final output of this code?

2. Consider a rectangle whose side lengths are two consecutive Fibonacci numbers. (Of course, neither of them is 0.) Such a rectangle could be, for example, 3 by 5, or 8 by 13, or 21 by 34, etc. (a) Give a recursive algorithm to dissect such a rectangle into squares such that no more than two of the resulting squares are the same size. (For example, if you had two 3 by 3 squares, you could have at most one 4 by 4 square.) Here's a specification for your algorithm: // Input: Two consecutive Fibonacci numbers f0, f1, representing an f0 by f1 rectangle, such that f0 <= f1. (Neither f0 nor f1 will be 0.) // Output: A list of integers representing side lengths of squares, such that the input rectangle can be dissected into squares of those sizes. No more than two of the squares can be the same size. Please be sure to give an English description of the algorithm along with pseu- docode, explaining the main points of its design, and a concise inductive argument for its correctness (i.e., say…

Tracing the Recursion. Observe the recursive solution provided below and answer the followingquestions:1. Which line(s) of this program define(s) the base case of the binary() method?2. Which line(s) of this program include recursive call(s)?3. Trace the recursion below. You must show the tracing step by step (write themdown); otherwise – little to no credit!4. At what step of your recursion tracing did you hit the base case?5. What is the final output of this code?

Keeping in mind data structures, recursion, and using Java What is the value returned from the following method when it is called with the value 5?   int mystery(int x, int y)    {       if (y == 0)          return 1;       if (y == 1)          return x;       return x * mystery(x, y-1);    }