Isomorphism and Subgraphs · Superchallenge problem

Using the Petersen graph's standard labeling (outer $5$-cycle, inner pentagram, spokes), how many $5$-element subsets of its $10$ vertices form an independent set (no two of the $5$ adjacent)?