 Solution

Let $p$ be a permutation of the finite set. Starting from $a$, repeatedly apply $p$. Some iterate repeats; because $p$ is invertible, the first repeat closes the sequence at $a$. More explicitly, if $p^i(a)=p^j(a)$ with $0\le i<j$, applying $p^{-i}$ gives $p^{j-i}(a)=a$. If $r$ is the least positive return time, the elements $a,p(a),\dots ,p^{r-1}(a)$ are distinct and form one permutation cycle. If the set is not exhausted, start again at an unused element. Two such sets cannot overlap: an overlap lets an inverse iterate express either starting point as an iterate of the other, making the sets identical. Thus this process partitions the set into disjoint permutation cycles. On each part its cycle acts exactly as $p$ and the other cycles fix the elements. Their product therefore equals $p$. This proves existence of the cycle decomposition of a permutation, including one-cycles for fixed points.

Use the composition convention that the rightmost permutation acts first. For the specified product, the images areHenceThe order of a group element here is the least positive exponent making every cycle return to the identity. It must be divisible by each cycle length, and any common multiple does make every cycle return. The least common multiple of $3,2,3$ is six.