For the following recurrences, find a good asymptotic upper bound using Master method $($if

applies$)$ and substitution method $(10)$

T $($n$)=2$T $($n$/2)+$ n lg n