Recursion Tracing Exercise: Two Successive Recursive calls

Khan.randRange(1, 10) Math.pow(2, Math.floor(Math.log2(i))+1) - 1

Consider the following function: void asterisksPrinter(int i) { if (i > 1) { asterisksPrinter(i / 2); asterisksPrinter(i / 2); } System.out.print("*"); } How many asterisks are printed by the method call asterisksPrinter(i)?
(Either write a number, or write "infinite recursion".)

ANS

Note that there are two recursive calls.

Don't forget that the print statement will be exectued on the rollback for EACH of the recursive calls.