A tree $T$ has $7$ leaves, and every internal (non-leaf) vertex has a degree of either $2$ or $3$. If $T$ contains exactly $4$ vertices of degree $2$, how many vertices of degree $3$ must it have?