Public Class Utilities { replaceCharacter Method public static void replaceCharacter​(char[] array, char target, char replacement) Replaces the target character in the array with the specified replacement. You can assume the array parameter will not be null. You may only use one auxiliary method. Your implementation must be recursive and you may not use any loop construct. Do not use ++ or -- in any recursive call argument. For example, use index + 1, instead of index++. Parameters: array - target - replacement -

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…

The following recursive method get Number Equal searches the array x of 'n integers for occurrences of the integer val. It returns the number of integers in x that are equal to val. For example, if x contains the 9 integers 1, 2, 4, 4, 5, 6, 7, 8, and 9, then getNumberEqual(x, 9, 4) returns the value 2 because 4 occurs twice in x. public static int getNumberEqual(int x[], int n, int val) { if (n< 0) ( return 0; } else { if (x[n-1) == val) { return getNumberEqual(x, n-1, val) +1; } else { return getNumber Equal(x, n-1, val); } // end if ) // end if } // end get Number Equal Demonstrate that this method is recursive by listing the criteria of a recursive solution and stating how the method meets each criterion.

import java.util.Scanner; public class LabProgram {      // Recursive method to draw the triangle    public static void drawTriangle(int baseLength, int currentLength) {        if (currentLength <= 0) {            return;  // Base case: stop when currentLength is 0 or negative        }         // Calculate the number of spaces needed for formatting        int spaces = (baseLength - currentLength) / 2;         if (currentLength == baseLength) {            // If it's the first line, don't output spaces before the first '*'            System.out.println("*".repeat(currentLength) + " ");        } else {            // Output spaces and asterisks            System.out.println(" ".repeat(spaces) + "*".repeat(currentLength) + " ");        }         // Recursively call drawTriangle with the reduced currentLength        drawTriangle(baseLength, currentLength - 2);    }        public static void drawTriangle(int baseLength) {        drawTriangle(baseLength, baseLength);    }     public static…

PYTHON: This exercise is a variation on "instrumenting" the recursive Fibonacci program to better understand its behavior. Write a supporting method that counts how many times the fib function is called to compute fib (n) where n is a user input. Hint: To solve this problem, you need an accumulator variable whose value "persists" between calls to fib. You can do this by making the count an instance variable of an object. Create a FibCounter class with the following methods: _init_(self) Creates a new FibCounter, setting its count instance variable to 0. getCount(self) Returns the value of count. fib(self, n) Recursive function to compute the nth Fibonacci number. It increments the count each time it is called. resetCount(self) Sets the count back to 0.