The next step in solving the recurrence relation is to propose a solution for the recurrence relation.

The proposed solution is:

T$($n$)=(1)$ c $+(2)$ d $$for all n $(3)$

Select the appropriate option for each blank.

Note:

answers may be used more than once

$^$ is used to indicate exponentiation, e$.$g$.,$ a$^($b$+$c$)$ is used to indicate a$($b$+$c$)$

Which of the following recurrence relations represents M$($n$),$ the total number of additions performed when Add$($n$)$ is executed?