Back Clear
# Your Problem: # 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) → 3 # powerN(3, 2) → 9 # powerN(3, 3) → 27 # # Credit for this problem goes to Nick Parlante from CodingBat.com # Do not modify anything outside of the function or the function itself. # CODE START def getPowerN(base:int, n:int) -> int: # CODE END # Press Ctrl+E (Command+E on mac) to test your code