Identify the basic operations and construct a recurrence relation C$($n$)$ that characterizes the time complexity of the algorithm. Determine the order of growth for C$($n$)$ by solving the recurrence relation.

Boo$($m$,$ A$[0..$n$-1])$

if $($n $==0)$

return false;

if $($A$[$n$-1]==$ m$)$

return true $||$ Boo$($m$,$ A$[0..$n$-2])$;

else

return false $||$ Boo$($m$,$ A$[0..$n$-2])$;