Write a recursive method, matchingParen (String str), that returns: true if str is a nesting of zero or more pairs of parentheses, like "(0)" or "(())". • false if str is null, or if str has any character other than right or left parentheses, or if the right and left parentheses do not match. System.out.println( matchingParen( ) ); System.out.println( matchingParen( "(())" ) ); System,out.println( matchingParen( "(()))" ) ); //true System.out.println( matchingParen( "((*))" ) ); System.out.println( matchingParen( "())) ) ); System.out.println( matchingParen( null ) ); //true //true //false //false //false Hint: You may check the first and last chars, and then recur on what's inside them. You may also find it easier to use a helper method.

Write a recursive method called add(int n). This method adds the integers from 0 to some value n. For example, the call to add(4) would return 10 (4+3+2+1=10).

Given a long string use recursion to traverse the string and replace every vowel (A,E,I,O,U) with an @ sign. You cannot change the method header. public String encodeVowels(String s){ // Your code here }

Write a static recursive method in Java called mRecursion that displays all of the permutations of the charactersin a string passed to the method as its argument. For example, the character sequence abc has thefollowing permutations: acb, bac, bca, cab, cba. Then Write a static method called getInput that get aninput string from the user and passed it to the mRecursion method written above in a method call.Please does so using what I already had   //Get input from in to call recursive method        //to display those char permutations        public static String getInput ( ) {            Scanner in = new Scanner(System.in);            String combination = in.nextLine();            System.out.println("Enter string:);             return stringComb; //Method to show permutations of a desired string// This only return 3 string combination for some reason        static void myRecursion(String aString) {            //isEmpty check            if ( aString.length() == 0){…

write a code in java (using recursion)

A palindrome is a string that reads the same forward and backward. For example,“deed” and “level” are palindromes. Write an algorithm in pseudocode that testswhether a string is a palindrome. Implement your algorithm as a static method inJava. The method should call itself recursively and determine if the string is apalindrome.Write a main method that reads a string from the user as input and pass it to thestatic method. You need to validate the string and make sure it contains only letters(no digits or special characters are allowed). The main method should displaywhether the string is a palindrome or not. a)  Read the string from the user and validate it.b)  Create a method that calls itself recursively and returns whether thestring is a palindrome or not.c)  Include a test table with at least the following test cases:1. Invalid input. For example, string contains a number or specialcharacter.2. A valid string that is a palindrome.3. A valid string that is not a palindrome.

The following recursive method called z is created. This method accepts two parameters: A string s, and an integer index  The code in the method is:      if (index == s.length())        return "";          <------ base case     if(index % 2 == 0)        return ""+ s.charAt(index) + z(s,index+1);           <---- recursive call     else        return z(s,index+1);             <----- recursive call   What would be the output with the call:   z("javajavajava",0);

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

Consider a recursive method below. static void mysteryRecursion (String x) { if (x.length() < 1) { System.out.println(x); } else { System.out.println (x.charAt (0) + " " + x.charAt (x.length () - 1)) ; mysteryRecursion (x.substring (1, x.length () - 1)); What gets printed if I make the method call mysteryRecursion("helloworld");

The method is in fact faulty. Give a test input (String) that will make the method to fail -- i.e., it will throw an exception when it is executed with the input).