Gapplet
Given a sequence of permutations, and a point we perform the orbit algorithm step by step.
Input a sequence of permutations, e.g., (1,2,3)(4,5), (3,4,5)
</COMMENT>
Input a point, e.g., 1
</COMMENT>
</COMMENT>
</COMMENT>
Perform the next step
</COMMENT>
The three sets New, Orbit, LastFound
</COMMENT>