Define a recursive function that when passed two integers (say x and n), returns x to the power of n. You should think of how to make it faster to avoid time-outs and/or StackOverflowErrors. You may not use any loops. For brownie points, write a theoretically tail-optimized version (since Java doesn't really facilitate tail-optimization... yet). Use the hint only if you have spent sufficient time thinking and are still stuck.