Bipartite Graphs and Matchings · Medium problem

Take the Petersen graph: outer $5$-cycle $1,2,3,4,5$, inner $5$-cycle $6,\dots,10$ (each connected two steps ahead), and spokes $16,27,38,49,5\text{-}10$. What is the size of a maximum matching of this graph?