Argue that the solution to the recurrence T$($n$)=$ T$($n $/3)+$ T$(2$n$/3)+$ cn$,$ where c is a constant, is $\backslash$Omega $($n lg n$)$ by appealing to a recursion tree.