This comes down to using the Orbit-Stabilizer Theorem, which says in short that $|Gx||G_x| = |G|$ for all $x$.
Orbit-Stabilizer tells us that the size of each orbit $Gx$ is a divisor of the size of the group $G$, so that in this case each orbit has size $1, 5, 7,$ or $35$. We clearly can't have $35$, since there aren't $35$ elements in the set. Similarly, we can't have $1$, because that would mean that every element of $g$ fixes that element.
So all the orbits are of size $5$ or $7$. But every element is in some orbit (namely, its own orbit). So we have a diophantine equation $5a + 7b = 17$ for positive $a,b$. There is exactly one solution, which is $a = 2, b = 1$.
Thus there are $3$ orbits, $2$ of size $5$ and $1$ of size $7$.