You are given two $$ matrices, and the task is to add them recursively. The matrix addition

algorithm divides each matrix into four $$

$2$

$2$ submatrices and recursively adds the corresponding

submatrices. The recurrence for the algorithm$$s time complexity is:

$()=4($

$2)+2$

Solve the recurrence and state the time complexity $()$ for:

a$)$ Master Theorem,

b$)$ Substitution Method, and

c$)$ Recursion Tree Method.