Write a recursive method that counts the number of postive integers in a bag from the client perspective

Write a recursive solution to the problem below. You MUST use only one method, and that method must have the provided method header. You are allowed to use loops, but you must also use recursion. Given a word of length n, print every possible word of length n that can be made with those characters. Note: The order of the output does not matter, only that all possibilities are listed. Example: Input: rot Output: rot, rto, otr, ort, tro, tor Input: frog Output: frog, frgo, fogr, forg, fgro, fgor, rogf, rofg, rgfo, rgof, rfog, rfgo, ogfr, ogrf, ofrg, ofgr, orgf, orfg, gfro, gfor, grof, grfo, gofr, gorf public void printAllPossibilities (String prefix, String suffix){ }

write a code in java (using recursion)

Code 16-1   /** This class has a recursive method.  */    public class EndlessRecursion {    public static void message() {    System.out.println("This is a recursive method.");  message();  } }   Code 16.2   /**  This class has a recursive method message,  which displays a message n times.  */   public class Recursive {  public static void messge (int n) {    if (n>0) {    System.out.println (" This is a recursive method.");  message(n-1);  } } }     Task #1 Tracing Recursive Methods 1. Copy the file Recursion.java (see Code Listing 16.1) from the Student Files or as directed by your instructor. 2. Run the program to confirm that the generated answer is correct. Modify the factorial method in the following ways: a. Add these lines above the first if statement: int temp; System.out.println("Method call -- " + "calculating " + "Factorial of: " + n); Copyright © 2019 Pearson Education, Inc., Hoboken NJ b. Remove this line in the recursive section at the end of the method: return…