Consider the following recursive method. int recursum(int a, int b) { if (a%b == 0) return b; else return recursum (b, a%b); } a. What is the output given by recursum (48, 18)? b. What is the output given by recursum (85, 25) ?

The solution can be handwritten b) Trace the following recursive method for the function call “isPalindrome(rotator)” and show the output result.

write a code in java (using recursion)

Java - Write an iterative method that calculates the SUM of all integers between 1 and a given integer N (input into the method). Write a corresponding recursive solution. (return answer, don’t print)

14) What does the following recursive method determine?public boolean question16(int[ ]a, int[ ] b, int j){if(j = = a.length) return false;else if (j = = b.length) return true;else return question16(a, b, j+1);}a) Returns true if a and b are equal in size, false otherwiseb) Returns true if a is larger than b, false otherwise c) Returns true if b is larger than a, false otherwise d) Returns true if a and b have no elementse) Returns the length of array a + length of array b

Write a Non tail recursion and a tail recursion method in Java with a test class that does the following: The factorial of a positive integer n —which we denote as n!—is the product of n and the factorial of n 1. The factorial of 0 is 1. Write two different recursive methods in Java that each return the factorial of n. Please and Thank you

For questions 1 – 2, use the following recursive method.public int question1_2(int x, int y){if (x == y) return 0;else return question1_2(x-1, y) + 1;} 2) Calling this method will result in infinite recursion if which condition below is initially true?a) (x = = y)b) (x != y)c) (x > y)d) (x < y)e) (x = = 0 && y != 0)

The factorial of a positive integer n —which we denote as n!—is the product of n and the factorial of n 1. The factorial of 0 is 1. Write two different recursive methods in Java that each return the factorial of n. Analyze your algorithm in Big-Oh notation and provide the appropriate analysis, ensuring that your program has a test class.

Which recursive method would return a value of 210 if result(7) was called?   Question 1 options:   public int result(int a){    if (a == 1){        return a;    }    else{        return a * result(a - 2);    }}   public int result(int a){    if (a == 1){        return 1;    }    else{        return a * result(a - 2);    }}   public int result(int a){    if (a == 1){        return a + 1;    }    else{        return a * result(a - 2);    }}   public int result(int a){    if (a == 1){        return 1;    }    else{        return a * result(a - 1);    }}

solve q5 only please