Write power(base, exp) for a non-negative integer exponent using fast recursion (square-and-multiply).
power(2, 10) → 1024
power(5, 0) → 1
Submit runs 5 tests, including hidden edge cases.
Each hint gives a little more help. Try on your own first.
Run your code to see the output here.