Write a program that implements a recursive algorithm that prints the factorial of the first 10 digits (1 to 10 and it is optional if you would like to include 0). The program must use a recursive algorithm and can be implemented in Java.

1. Write a recursive method expFive(n) to compute y=5^n. For instance, if n is 0, y is 1. If n is 3, then y is 125. If n is 4, then y is 625. The recursive method cannot have loops. Then write a testing program to call the recursive method. If you run your program, the results should look like this: > run RecExpTest Enter a number: 3 125 >run RecExpTest Enter a number: 3125 2. For two integers m and n, their GCD(Greatest Common Divisor) can be computed by a recursive function. Write a recursive method gcd(m,n) to find their Greatest Common Divisor. Once m is 0, the function returns n. Once n is 0, the function returns m. If neither is 0, the function can recursively calculate the Greatest Common Divisor with two smaller parameters: One is n, the second one is m mod n. Although there are other approaches to calculate Greatest Common Divisor, please follow the instructions in this question, otherwise you will not get the credit. Meaning your code needs to follow the given algorithm. Then…

1) Write the SQL code to add a binary variable “Hire_prior_2000” in the Employee table.If the hire year (year of hire needs to be identified) is prior to 2000, then Hire_prior_2000=1, other wise Hire_prior_2000=0.

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