Please use java

Task 4 In the lecture, we implemented expon which raises x to the nth power. It took advantage of the fact that xn=x(x(n1)) Using recursion (no loops) implement the method fastExpon which raises x to the nth power. It will take advantage of the fact that if n is even, then: xn=(xmn/2)2 to greatly reduce the number of of recursive calls and multiplications that will need to be done to compute the answer. (We're using to indicate exponentiation in the above formula.) You may assume x and n will both be nonnegative