Write a program named Lab18D with: A recursive method that accepts an array of strings. It should return a count of strings in the array that start with an 's' and print them as well (on one line with a space between them). A second recursive void method that receives an array of strings and prints the array (on one line with spaces between the values.) Don't use the Arrays.toString method to shortcut this; each recursive call of the method should only print one string. The main method should read an unknown number of strings from the input file (Lab18D.txt) into an array. (Each string is a single word.) Call the method to print the array and then the method to look for strings starting with an 's'. Print a label before calling this method.

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){…

Please help me with the below using java. Please also comment the code (explai. What each li e is doing). Please make sure both codes are completed using recursion

Given a list of integers, you want to know whether it is possible to divide the integers into two sets, so that the sums of the two sets are the same. Every integer must be in one set or the other. Write a recursive helper method that takes any number of arguments you like, and make the initial call to your recursive helper method from equalSum(). Do not use any loops or regular expressions. Test case 1: equalSum([2, 3, 5]) true Test case 2: equalSum([2, 2, 5]) false