A recursive solution that finds the factorial of $\backslash ($ n $\backslash )$ always reduces the problem size by $\_\_\_\_\_\_\_\_\_$ at each recursive call.

Question $10$ options:

$1$

half

$2$

one$-$third