Planar Graphs · Hard problem

A connected simple planar triangulation (every face a triangle, the maximum possible edges for its vertex count) has $10$ vertices, each of degree either $4$ or $5$. How many vertices have degree $5$?