Consider the following code segment for computing Fibonacci numbers. How many times is fib$(3)$ computed in order to compute $?$

$```$

def fib$($n$)$:

if n :

return $1$

else :

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

$```$

$5$

$3$

$1$

$7$