Let G be a simple connected regular graph that is not Eulerian.

Prove that if G' is connected then G' is Eulerian.

Hi, I'm having a difficult time starting these proofs, with a tip from the last one I was able to get going so I was wondering if someone could help get me started on this one.

I know that to be Eulerian G' must have a closed trail that includes every edge of G'

Thanks and + rep