Show the recursive calls of calculating the $6$ th Fibonacci number using the following algorithm,

ALGORITHM Fib$(n)$

$//$Computes the $n$th Fibonacci number iteratively by using its definition

$//$Input: A nonnegative integer $n$

$//$Output: The $n$th Fibonacci number

$F[0]larr0$;$F[1]larr1$

for ilarr$2tondo$

$q,F[i]larrF[i-1]+F[i-2]$

return $F[n]$