For each of the following recurrence relations, determine the runtime t$($n$)$ complexity.

Use the Master Theorem to solve the recurrence relations if the recurrence relations can

be solved using Master Theorem, otherwise use expansion $($or recursive substitution$)$

to solve the recurrence relations. You must show all your working to justify your answer.

Solution without clear justification or steps scores no mark$(0)=1(4\mathrm{.}0$ marks