CSD201_-_SP_2025_-_RE_3731.webp

☑Kizspy.me
(Choose 1 answer)
☐ A
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);
Back
}
}
Next
FUO.sh
sh the exam.
Which call will result in the most recursive calls?
A. fun(1023);
B. fun(100);
C. fun(0);
D. fun(-1023);