Write functions (in Java) that draw Pyramid with “*” given height and stars variables. Make implementations for both iterative and recursive design. IterativePrintPyramid(int height) * * * * * * * * * * * * * * * * * * * * * * * * * RecursivePrintPyramid(int height, int stars) * * * * * * * * * * * * * * * * * * * * * * * * *

in java Describe the definition of recursive function. oBase case(s)oRecursive case(s)2. Write the code part of code below      public class ReverseArray { public static void main(String[] args) {   // TODO Auto-generated method stub public static void reverseArray(int[] data,int low, int high ) { if(low < high) { int temp = data[low]; data[low] = data[high]; data[high] = temp; reverseArray(data, low + 1, high -1); } }

Use java and correctly indent code.

I have two questions: Is my programs code the most effective way at finding recursion or is there a much better and cleaner way? Why is the program showing 0 when I implement a number that depth is greater than 100? Shouldn't it show the number 1?   Source code: package recursiveModule; public class RecursiveMethod {    public static long calculateFactorial(int n, int depth) {        if (depth > 100 || n <= 1) {            return 1;        }                return n * calculateFactorial(n - 1, depth + 1);    }          public static void main(String[] args) {                             System.out.println("Factorial of 1 is " + RecursiveMethod.calculateFactorial(1, 0));                System.out.println("Factorial of 8 is " + RecursiveMethod.calculateFactorial(8, 0));                                      System.out.println("Factorial of 101 is " + RecursiveMethod.calculateFactorial(101, 0));                                   } }