Consider the following recurrence:

$T(n)=3T(\frac{n}{3})+3T(\frac{n}{2})+n^2$

$T(1)=C$

Create a visually clear recursion tree table consisting of the level, a visual of the recursive calls for the level, and the work$/$cost for the level. The levels should include, $0,1,2,$ i$,$ and the determined last level of the recursion tree. Show work where relevant.