Give asymptotic upper bounds obtained using the recursive tree and adding up the work done in each iteration for T$($n$)=2$T$(2$n$/3)+$ n$^2$