Q$1$: Consider the following algorithm.

a$)$ Write the recurrence for this algorithm.

b$)$ Find $0$ and $$ for the algorithm.

Recursive$\_$f$($n$)$

if $(n<mn\; id="EditorElement\_25857">2</mn><mi\; id="EditorElement\_25859">)</mi>$

return $n$

return Recursive$\_$f $(n-1)+$ Recursive$\_$f $(n-2)$