Can you explain how to implement the below on JFLAP?

Write a deterministic, single tape Turing Machine with at most $25$ states, that copies

the letters before the $,$ to after the $,$ so that the letters are interleaved as follows: x

occurrences of the first letter, followed by y occurrences of the second, followed by x

occurrences of the first, etc. $..$ with any remaining letters $($also interleaved$)$ at the end.

The input should remain unchanged.

So$,$ returning to the input examples above, the Turing Machine should halt with the

following on its tape respectively:

$$ ccccdddddd$$ccdddccddd

$$ cccccccddddd$$ccdddccddccc

$$ ccdddd$$ccdddd

$$ ccccccdddd$$ccdddccdcc

$$ c$$c

$$ ddd$$ddd