Solve the following recurrences using the recursion tree technique. $3+3+3+5$ points. Make sure to present your argument, not just the final answer, clearly.

A$($n$)=2$A$($n$/4)+$nA$($n$)=2$A$($n$/4)+$n

$$

B$($n$)=3$B$($n$/3)+$nB$($n$)=3$B$($n$/3)+$n

C$($n$)=4$C$($n$/2)+$n$2$C$($n$)=4$C$($n$/2)+$n$2$

D$($n$)=$D$($n$/2)+$D$($n$/3)+$D$($n$/6)+$nD$($n$)=$D$($n$/2)+$D$($n$/3)+$D$($n$/6)+$n