Trees · Hard problem

A tree has maximum degree $4$ (no vertex has degree more than $4$) and exactly $10$ leaves. What is the minimum possible number of vertices the tree can have?