Solve the following recurrence relation. To solve the problem, you have to use the backward substitution and show the intermediate results. After that, you should present the time complexity of the recurrence relations.

M(n) = 2 * M (n-1) // Recurrence relation

M()) = 3 // Initial condition