Analyze the following code and from the statements below select those that are true.

public class TwoRecursiveMethods $\{$

public static void main$($String$[]$ args$)\{$

System.out.println$($f$1(3,0))$;

System.out.println$($f$2(3))$;

$\}$

public static int f$1($int n$,$ int result$)\{$

if $($n $==0)$

return result;

else

return f$1($n $-1,$ n $+$ result$)$;

$\}$

$\}$

public static int f$2($int n$)\{$

if $($n $==0)$

return $0$;

else $\{$

return n $+$ f$2($n $-1)$;

$\}$

$\}$

Group of answer choices

f$1$ is tail recursion, but f$2$ is not

For a non$-$negative input n$,$ f$2$ computes $0+1+2+...+$ n

For a non$-$negative input n and initial value of result $=0,$ f$1$ computes $0+1+2+...+$ n

Neither f$1$ nor f$2$ is tail recursive

For all negative inputs both f$1$ and f$2$ run infinitely and cause a StackOverflowError

f$2$ is tail recursion, but f$1$ is not