Proving that the set of units of a

Step 1
My guess is that we need to show that the group can be generated by some element in the set, do I need to show that powers of some element can generate all elements in the other congruence classes?
It is enough if you find one element such that its powers cover exactly the group. I would give ${\displaystyle \bar{3}}$ a try.
For example $7^2=49\equiv 9\text{mod}10$, i.e. using 7 we can generate an element in the congruence class of 9, but can not generate 29 for example from any power of 7, so is it sufficent to say that an element is a generator if it generates at least one element in all other congruence classes?
Step 2
Edited following Cameron Buie's comment: ${\displaystyle \bar{7}}$ actually works, as it generates ${\displaystyle \bar{9},\bar{3}\text{and}\bar{1}}$, in that order.
Let's see what happens with ${\displaystyle \bar{3}}$:
- ${\displaystyle {\bar{3}}^1=\bar{3}}$
- ${\displaystyle {\bar{3}}^2=\bar{9}}$
- ${\displaystyle {\bar{3}}^3=\overline{27}=\bar{7}}$
- ${\overline{3}}^4=\overline{81}=\overline{1}$
This is enough. On the one hand, we have covered all the elements in the subgroup. On the other hand, we are now satisfied that ${\displaystyle {\bar{3}}^4}$ is the neutral element of the group, so we are positive that for any natural number n, ${\overline{3}}^n={\overline{3}}^{n\mathrm{mod}4}$.