I know that the time complexity is O(logn) but I am not sure how. Can you please write down the math (not explanation) steps you would take to find that the time complexity is O(logn).

public static long exponentiation (long x, int n) return 1; else if (n1) return x else if (n%2 0) // if exponent is an even integer return exponentiation (xx, n/2) else // if exponent is an odd integer return xexponentiation(x, n-1)