Given the following recurrence

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

Draw the first $3$ levels of the sustitution tree

Find the number of nodes at level $i=10$

What is the input size at level $i=5?$

What is the complexity at level $i=4?$

What is the total complexity of the recurrence?