which of the following methods is recursive ?     public static int length(String str) {     if (str == null || str.equals(""))        return 0:   else   return 1 + length(str.substring(1));    }       public static int length(Strin str) {     if (str == null || str.equals(""))        return 0:   else   return 1;    }       public static int length(Strin str) {     if (str == null || str.equals(""))   return 0:      else   return 1 + len(str.substring(1));    }       public static int length(String str) {     if (str == null || str.equals(""))   return 0:    }     java

Consider the following recursive method: public int recursiveMethod (int n) if (n <= 0) return 0; else int smaller = n - 1; return recursiveMethod (smaller) + n (n - 1); What is the integer return of a call recursiveMethod (5)? 36 39 40 44 Next Page Previous Page

Consider the following recursive method:   Public static int Fib(int a1, int a2, int n){   if(n == 1)      return a1;   else if (n == 2)      return a2;else      return Fib(a1, a2, n-1) + Fib(a1, a2, n-2);} Please draw the recursion trace for Fib(2,3,5)

Please explain the questions related to the code below:   //1. Why is 20 printed 3 times and why does it start with 1, but end with 2? //2. What is the base case for this recursive method and why?             //3. How would you implement this using a loop? //4. What is each if statement checking?             //5. Would a solution to this using loops require more or less code and would it be more or less effecient? //6. Why is recursion a good choice to solve this problem? //7. How can recursion become infinite?             //8. When is recursion appropriate?     /* Load the code below into a cloud compiler and run each method one at a time by removing the comments for the method. Walk through the code as a group and explore how the code works. Submit the answers to the numbered questions for credit. */   public class DemoRecur {             //Simple statement designed to show control flow in recursion             public static void printDemo(int x, int max)             {…

Write a recursive method to determine whether a String contains a 'q' not immediately followed by a 'u' (ignoring capitalization). In other words: • the word does contain at least one 'q' • and that q is followed by anything except a 'u' Carefully review the provided driver program to see example test cases. The method header is: public static boolean qNotFollowedByU(String word)

A recursive method with no  base case?    1.causes an infinite loop 2.generates no output 3.does not start 4.all of the answers

solve q4 only please