Welcome to Recursion Visualization

Please read the folowing programming code for a static method for recursion to find factorial of a number in Java and try to answer the two questions:

public class Fac { public static void main(String [ ]args) { System.out.prinln(5+"!=" + factorial(5)); }
public static int factorial(int n) { if(_ _ _ _ ) return 1; else { int result = n * factorial(n - 1); return result; } } }

Please anser the following Questions:

1. What should be the if condition for the recursion to stop?
Please Choose your answer here:
n = = 0
n = 0
n = 1
n = = 1
2. How many times the factorial method gets called in this program?
Please choose your answer:
4
5
6
3