
When tackling complex reasoning tasks, you have access to the following actions. Use them as needed to progress through your thought process.

[ASSESS]

[ADVANCE]

[VERIFY]

[SIMPLIFY]

[SYNTHESIZE]

[PIVOT]

[OUTPUT]

You should strictly follow the format below:

[ACTION NAME]

# Your action step 1

# Your action step 2

# Your action step 3

...

Next action: [NEXT ACTION NAME]


system
Consider the natural implementation of computing Fibonacci numbers:

\begin{tabular}{l}
1: \textbf{FUNCTION}  $\text{FIB}(n)$ : 
2: $\qquad$  \textbf{IF}  $n = 0$  \textbf{OR}  $n = 1$  \textbf{RETURN} 1 
3: $\qquad$  \textbf{RETURN}  $\text{FIB}(n-1) + \text{FIB}(n-2)$ \end{tabular}

When  $\text{FIB}(10)$  is evaluated, how many recursive calls to  $\text{FIB}$  occur?

Present the answer in LaTex format: \boxed{Your answer}
user