what will be the time complexity of the following code?
int xpowy(int x, int n)
{
if (n==0)
return 1;
if (n==1)
return x;
if ((n ) == 0)
return xpowy(x*x, n/2);
else
return xpowy(x*x, n/2) * x;
}
a. ( logn)
b. (n)
c. (nlogn)
d. (n∗n)