What Will Be The Time Complexity Of The Following Code P Pre #1863

 int xpowy(int x, int n) { if (n==0) return 1; if (n==1) return x; if ((n % 2) == 0) return xpowy(x*x, n/2); else return xpowy(x*x, n/2) * x; }