Question $2[20$ Marks$]$

Consider the following recursive algorithm.$($A$)[5$ Marks$]$ Using a detailed analysis, what are the time complexities of the Direct Solution, Divide $($Prework$),$ Conquer and Combine $($Postwork$).($B$)[5$ Marks$]$ Write the recurrence relation for the time complexity T$($n$).($C$)[5$ Marks$]$ Find the solution to T$($n$)$ and its efficiency.$($D$)[5$ Marks$]$ Establish the order of growth of the efficiency.