Another language transformation: Let $$ be an arbitrary set, and $L$ be a language defined over $.$ Define an operation cycle as the following:

cycle$(L)$:$=\{xy|x,$yin${}^{**},$yxinL$\}$

Prove that the class of regular languages is closed under the operation cycle.