Consider the recursive version of the fib method from the textbook shown

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

$\{$

if

t

return $13$

$\}$

else

$\{$

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

$\}$

$3$

How many more recursive calls to fib will be made from the original call of fib$($ the original call of fib$(6)($not counting the original calls$)?$