$q,$

Page $1$:

Question $19(1$ point$)$

Consider the following recursive method:

private int funcl$($int $m,$ int $n)$ f

if $|n==1$

return $1$;

else

return func$1(m-1,n-1)+n^{**}$ func $1(m-1,n)$;

$\}$

What precondition must exist in order to prevent the code above from infinite recursion?

$12$

A$)mn$ and $n0$