function factorial(n) {
// This is our Base Case - when n is equal to 0, we stop the recursion
if (n === 0) {
return 1;
}
// This is our Recursive Case
// It will run for all other conditions except when n is equal to 0
return n * factorial(n - 1);
}