-Are the space and time complexity the same for this method?

3. (10 Points) Given the following recursive method, answer these questions in big Oh notation with brief explanation. a) What is the best-case and worst-case space complexity? b) What is the best-case and worst-case running time public static long power(int a, intn) t if tn=-0) { return 1; else t n/2); long x = power(a, if(n%2-0) { // if nis even return x*x; } else 1 return a*x*x