Use the recursion tree method to find a tight bound for T $($n$)=$ T $($n$/3)+2$T $(2$n$/3)+\backslash$Theta $($n$)$