I'm trying to solve this question for a while and I think I'm missing something.
if you can please help me without using "Cauchy's theorem".
My try
By Lagrange's theorem we know that for each $g \in G : o(g)||G| \Rightarrow o(g)|22$
So we have only $4$ options : $o(g)=1 , o(g)=2 , o(g)=11 , o(g)=22$
Let's cancel the option $o(g)=1$ because then $g=e$ and it won't help us.
if $o(g)=22 \rightarrow G$ is cyclic so we can pick $o(g^2)=11$ and $o(g^{11})=2$ so we are done.
I'm stuck in this phase of if $o(g)=2$ or $o(g)=11$
I tried proving by contradiction that it can't be that exist more than $1$ elemet of order $2$ or $11$
I know that the amount of elements of order $2$ is odd (since $22$ is even).
I know that $2$ and $11$ is prime.
I noticed I didn't use the fact that $G$ is abelian so I guess I need to use it somehow yet I don't know how.
Any clues would help.
Have a nice day and thank you!