Look at the recursive function Factorial below. If the function is called and the number $6$ is passed, how many times will the function will be called?

int factorial$($int n$)\{$

if$($n $>1)$

return n $*$ factorial$($n $-1)$;

else

return $1$;

$\}$

$6$

$3$

$02$

$)4$