I have a problem like this:

In terms of N, what is the running time of the following algorithm to compute X^N

How would I go about solving that?Code:`public static double power(double x, int n)`

{

double result=1.0;

for(int i=0; i< n; i++)

result*=n;

return result;

}