Course · Section 10: A Closer Look at Functions · Lecture 137: First-Class and Higher-Order Functions
Implement `pow(base, exp)` returning `base` raised to the non-negative integer `exp`, using recursion.
+ 1 hidden test run on Submit.
Repeated multiplication unwinds from exp down to 0, where the product is 1.
Run your code to see results.