Consider the following recurrence relation and initial condition for a recursive algorithm

$M(n)=2*M(n-1)+1\frac{\frac{?}{?}}{r}$ecurrence relation

$M(1)=1\frac{\frac{?}{?}}{i}$nitial condition

This is the first step of the backward substitution to get the time complexity of the algorithm. Select the correct result of the first substitution.

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

$=?$

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

$2*M(n-2)+2+1$

None of these.

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

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