How many calls to fib$0$ are made if the initial call is fib$(3)?$

def fib$(n)$ :

if $n==$ or $n==1$ :

return $1$

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

Select one:

$1$

$2$

$3$

$5$

Clear my choice