For this Question: You are given two numbers n and p. You need to find n raised to the power p.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>RecursivePower</b> that takes the integer n and p as a parameter.

Constraints:
1 <= T <= 10
1 <= n, p <= 9Return n^p.Sample Input:
3
2 3
9 9
2 9

Sample Output:
8
387420489‬
512

Explanation:
Test case 2: 387420489 is the value obtained when 9 is raised to the power of 9.
Test case 3: 512 is the value obtained when 2 is raised to the power of 9, I have written this Solution Code: 

static int Power(int n,int p)
    {
        if(p==0)
          return 1;
        return n*Power(n,p-1);
    
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?