Given the recursive method ‘recursiveExponent’, what is its time complexity in Big-O notation?

public class ExponentialRecursion {
    public void recursiveExponent(int n) {
        if(n <= 1) return;
        recursiveExponent(n/2);
        recursiveExponent(n/2);
    }
}