What is the time complexity of the recursive reverse method shown above?

public String reverse(String s) {
    if(s.length() <= 1) return s;
    return reverse(s.substring(1)) + s.charAt(0);
}