What is the recurrence equation describing the worst$-$case running time of the following recursive algorithm?

Assume that $N$ is the number of elements in the array and that the value of 'pos' in the first call to the algorithm is

equal to the highest index of array A$.$

function $,$ pos $)$

if $(pos<mi\; id="EditorElement\_89427"></mi><mi\; id="EditorElement\_89429">)</mi>$

return $$

if $($pos$0$ or pos$-1]==1$ or $A[pos+1]==1)$

return $,$ pos $-1$