Given the following code:

public static int question$($int m$)\{$

if$($m$==0)\{$

return $1$;

$\}$

else $\{$

return m$*$question$($m$-2)$;

$\}$

$\}$

Which of the following calls will cause infinite recursion?

A$.$ int x$=$question$(10)$;

B$.$ int x$=$question$(11)$;

C$.$ int x$=$question$(0)$;

D$.$ int x$=$question$(-2)$;