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: import java.util.*;
import java.io.*;
import java.lang.*;

class Main
{
    public static void main (String[] args)throws Exception {
        
        BufferedReader read = new BufferedReader(new InputStreamReader(System.in));
        int t = Integer.parseInt(read.readLine());
        
        while(t-- > 0)
        {
            String str[] = read.readLine().trim().split(" ");
            double X = Double.parseDouble(str[0]);
            int N = Integer.parseInt(str[1]);
            
            System.out.println(String.format("%.2f", myPow(X, N)));
        }
    }
    
    public static double myPow(double x, int n) {
        if (n == Integer.MIN_VALUE)
            n = - (Integer.MAX_VALUE - 1); 
        if (n == 0)
            return 1.0;
        else if (n < 0)
            return 1 / myPow(x, -n);
        else if (n % 2 == 1)
            return x * myPow(x, n - 1);
        else {
            double sqrt = myPow(x, n / 2);
            return sqrt * sqrt;
        }
    }
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?