Multiple Choices
(Choose 1 answer)
Consider the following function:
void fun(int n)
{if (n < 0)
{System.out.println("-");
fun(-n);
}
else if(n<10)
System.out.println(n);else
{fun(n/10);
System.out.println(n%10);
}
} Which call will result in the most recursive calls?
A. fun(1023);
B. fun(100);
C. fun(0);
D. fun(-1023);
E. fun(1025);
