Given the following recursive method, answer each of the following questions.
public static void countDownByTwo(int n) {
if(n != 1) {
System.out.println(n + “ ”);
countDownByTwo(n-2);
} // end if
} // end countDownByTwo
a. What happens when you execute the mediod with n = 7?
b. What happens when you execute the method with n = 6?
c. Answer the four questions for constructive recursive solutions to prove or disprove the correctness of this recursive solution.
d. If the answer to one or more of the questions in part c.indicates diat this solution is incorrect, how would you change the method in such a way as to fix the problem?
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.