Given base and n that are both 1 or more, compute recursively (no loops) the value...

  

Transcribed Image Text:

Given base and n that are both 1 or more, compute recursively (no loops) the value of base to the n power, so powerN(3, 2) is 9 (3 squared). powerN(3, 1) will return 3 powerN(4, 2) will return 16 powerN(6, 0) will return 1 import java.util.Scanner; public class L13Num2 { public static void main(String[] args) { Scanner scnr = new Scanner(System.in); int num=scnr.nextInt(); int power = scnr.nextInt(); System.out.println(num + " raised to the power of " + power + " is powerN(num, power)); } public static int powerN(int num, int p) } Given base and n that are both 1 or more, compute recursively (no loops) the value of base to the n power, so powerN(3, 2) is 9 (3 squared). powerN(3, 1) will return 3 powerN(4, 2) will return 16 powerN(6, 0) will return 1 import java.util.Scanner; public class L13Num2 { public static void main(String[] args) { Scanner scnr = new Scanner(System.in); int num=scnr.nextInt(); int power = scnr.nextInt(); System.out.println(num + " raised to the power of " + power + " is powerN(num, power)); } public static int powerN(int num, int p) }

Answer rating: 100% (QA)

It seems like you are trying to implement a recursive function in Java to calculate t... View the full answer