Consider the fib method from the textbook shown below.

public static long fib$($int n$)$

$\{$

if $($n $<=2)$

$\{$

return $1$;

$\}$

else

$\{$

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

$\}$

$\}$

Calling fib$(3)$ will trigger $\_\_\_$ recursive call$($s$)$ and execute the terminating condition $\_\_\_$ time$($s$),$ respectively.

Question $13$ options:

$1,1$

$1,2$

$2,2$

$2,1$