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

if $($n $==0||$ n $==1)\{$

return $1$;

$\}$

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

$\}$

The given code calculates the factorial of a non$-$negative integer $\text{'}$n$\text{'}$ using recursion. While it works correctly for many cases, what potential issue or limitation might arise when calculating the factorial of a very large integer $\text{'}$n$\text{'}?$ How could you address this issue to ensure accurate results for large factorials?