Consider the following algorithm.

ALGORITHM mystery $($A$[0,$n$-1])$:

if $n=1$ then

return $A[0]$

else

temp $=$ mystery $(A[1$dotsn$-1])$

if $A[0]>$ temp then

return $A[0]$

else

return temp

Given that comparison operations are chosen as the main operation executed by this algorithm, and $n$ represents the size of the input, which of the following recurrence relations and initial conditions accurately represent the number of times the basic operation is executed?

$M(n)=M(n-1)+n,M(1)=2$

$M(n)=M(n-1)+2,M(1)=1$

$M(n)=M(n-1{)}^{**}2,M(1)=1$

$M(n)=M(n-1)+2,M(1)=2$