What is the worst$-$case time complexity 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\_633180"></mi><mi\; id="EditorElement\_633182">)</mi>$

return $$

if $($pos$0$ or pos $-1$