For this Question: Implement pow(X, N), which calculates x raised to the power N i.e. (X^N). 
Try using a recursive approachThe first line contains T, denoting the number of test cases. Each test case contains a single line containing X, and N.

<b>Constraints:</b>
1 &le; T &le; 100
-10.00 &le; X &le;10.00
-10 &le; N &le; 10
For each test case, you need to print the value of X^N. Print up to two places of decimal.

<b>Note:</b> 
Please take care that the output can be very large but it will not exceed double the data type value.Input:
1
2.00 -2

Output: 
0.25

<b>Explanation:</b>
 2^(-2) = 1/2^2 = 1/4 = 0.25, I have written this Solution Code: def power(N,K):
    return ("{0:.2f}".format(N**K))


T=int(input())
for i in range(T):
    X,N = map(float,input().strip().split())
    print(power(X,N)), In this Programming Language: Python, Now tell me if this Code is compilable or not?