Consider the following method:
public void doSomething(int n){
if (n>0){
doSomething( n−1);
StdOut.print(n);
}
}
How many recursive calls are made by doSomething(n)?
I. lg n
II n
III n∧2 (n squared)
IV n∧3 ( n cubed)
V 2∧n (2 to the power n)

O V only
O II only
O III only
O I only
O IV only