Consider the fib method from the textbook shown below:

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

$\{$

if $(n2)$

$\{$

return $1$ ;

$\}$

else

$\{$

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

$\}$

$\}$

Computing the $7$th fibonacci number, fib$(7),$ recursively computes fib$(6),$fib$(5),$ and fib$(4)q,$ times respectively.

$6,5,$ and $4$

$3,2,$ and $1$

$1,2,$ and $3$

$4,5,$ and $6$