Part b-EclipselJava (Don t forget to write your name and lab day and time as a c
ID: 3724038 • Letter: P
Question
Part b-EclipselJava (Don t forget to write your name and lab day and time as a comment on top of each java file. Also add comments explaining your logie whenever possible) Write a program that calls a recursive method called multiply that takes two integer parameters a and b, where a and b are both positive integers. You can only use the + or for multiplication. Write a recursive method called starString that accepts an integer as a parameter and prints to the console a string of starts (asterisks) that is 2n (i.e. 2 to the nth power) long. For example: 1. 2. tarString(0) should print (because 20-1) starString(2) should print(because 224) tarStrting(4) should print(because 2416)Explanation / Answer
RecursiveMethodsTest.java
public class RecursiveMethodsTest {
public static void main(String[] args) {
System.out.println(multipy(5, 6));
starString(4);
}
public static int multipy(int a , int b) {
if(b== 0) {
return 0;
} else {
return a + multipy(a, b-1);
}
}
public static void starString(int n) {
displayStar((int)Math.pow(2, n));
}
public static void displayStar(int n) {
if(n==0) {
System.out.println();
return;
} else {
System.out.print("*");
displayStar(n-1);
}
}
}
Output:
30
****************