Define a tail optimised 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.