Implement `power(x, n)` returning `x` raised to the non-negative integer `n`, using fast exponentiation.
+ 1 hidden test run on Submit.
Exponentiation by squaring runs in O(log n) time.
Run your code to see results.