Analyze the following recursive method and select from the statements below all those that are true.

public static void xMethod$($int n$)\{$

if $($n $>0)\{$

System.out.print$($n $\%10)$;

xMethod$($n $/10)$;

$\}$

$\}$

Group of answer choices

xMethod displays digits of the input value n in reverse order

The base case is n $<0$

The base case is n $>0$

xMethod does not have any base cases

The base case is n $<=0$

The method runs infinitely and causes a StackOverflowError