Write a JAVA CODE recursive function that when passed a value n displaysn (n-1) (n-2) (n-3) ... 0 ... (n-3) (n-2) (n-1) nfor example, if passed 5 displays 5 4 3 2 1 0 1 2 3 4 5

//Begin class declaration

public class RecursiveFunction {

   //Write function

   //It takes in an int value as parameter

   //And returns a string value.

  public static String recursivefn(int n){

       //Check the value of variable n

       //If the value is less than or equal to 0

       //Return the string "0"

       if(n <= 0){

           return "0";

       }

       //If n is not less than or equal to zero,

       //return a string that has:

       //1. n,

       //2. followed by a space,

       //3. followed by another call to the function with n - 1

       //4. followed by a space,

       //5. followed by n

       return n + " " + recursivefn(n-1) + " " + n;

   }

   //Begin main method

    public static void main(String []args){        

       //Call the recursivefn() on 5

       System.out.println(recursivefn(5));        

    } //End of main method

} //End of class declaration

5 4 3 2 1 0 1 2 3 4 5

The code has been written in Java. It contains comments explaining important parts of the code. Please go through the comments.

A sample output has also been provided.

The program file and a screenshot of the output have also been attached to this response.

answer; i do believe that the correct answer to the above statement is craig should use scheduling