What is the output of the following recursive method when factorial(5) is called?

public static int factorial(int n) {
    if (n == 0) return 1;
    else return n * factorial(n-1);
}