Isomorphism and Subgraphs · Superchallenge problem

Among the $4$ non-isomorphic graphs on $6$ vertices with degree sequence $3,3,2,2,2,2$, how many are triangle-free?