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