You must write the code for the recursive methods. NO LOOPs ALLOWED - ANYWHERE!. Here is the starter file:import java. io.*;public class Project5{ public static void main( String[] args ) { // T R I S T A R S // assume you are just given a single number that says how many rows of stars are in your triangle // an input of 1 means a singe row - the top row // * <= the answer is 1 // an input of 2 means the top tow and the second row // * // * * <= the answer is 3 since now you have 3 stars // an input of 3 means the top tow and the next two rows // * // * * // * * * <= the answer is 6 since now you have 6 stars // do you see the pattern? code it up recursively! int rows = 5; System. out. format("%d row triangle tree contains %d stars\n", rows, triStars(rows) ); // S U M D I G I T S int number = 12345; System. out. format("sum of digits in %d = %d\n", number, sumDigits( number ) ); // C O U N T 7 S number = 713274772; System. out. format("%d occurances of digit 7 in %d\n", count7s(number), number ); // C O U N T 8 S -but- there is a twist! Any 8 with an 8 to its left counts as TWO 8s number = 82338828; System. out. format("%d occurances** of digit 8 in %d\n", count8s(number), number ); // P O W E R N int base=2,exponent=8; System. out. format("%d to the power %d = %d\n", base, exponent, powerN(base, exponent) ); // I S S O R T E D // perturb values as needed to test for your own benefit on an unsorted array (we will test on an unserted too) int[] array = { 7, 8, 12, 20, 21, 22, 37, 41, 55, 60, 65, 74, 83, 84, 87 }; int startingAt=0; boolean isSorted = isSorted( array, startingAt, array. length ); System. out. print( "array: "); for ( int i=0 ; i