I need to find a $3$-approximation algorithm for finding a $3$-hitting set.

The set-up is that I have a set $S$ and a family $\mathcal{F}$ of subsets of $S$, where each member of $\mathcal{F}$ **contains exactly $3$ elements**. I need to find a hitting set (a set which intersects all members of $\mathcal{F}$) with the minimum number of elements.

If instead all the sets have size $2$, I already know that I can use the vertex cover problem to find a $2$-hitting set. For example, we can make a graph $G(V,E)$ where $V=S$ and $E=\mathcal{F}$. Then a vertex cover is also a hitting set.

But how would this work if the subsets of $S$ must have $3$ elements? And can we get a $3$-approximation algorithm?

I just learned about hypergraphs and I have a feeling that goes in the right way?