Show me the steps to solve:

Before starting Question $3$ it is IMPORTANT to know that my IT Login is addd$926.$

Question $3$: The following is required for this question. Generate integers x and y from your login$.$

Call the first digit of your login i and the second j$.$

The numbers are defined as follows:

$$ x $=($i $+1)/4|$

$$ y $=[($j$+1)/4]$

Also, let & be the second and third characters of your login together with the symbol $\text{'}*\text{'}($if these two letters are the same, then please select the next letter in the English alphabet for your second letter$).$

Input to a Turing Machine is a sequence of occurrences of your first letter, followed by a sequence of occurrences of your second letter, followed by a $*.$

You should assume that the input has the correct syntax, i$.$e$.,$ only these two letters occur in the input, in the correct order $($followed by a $*).$

You should also assume that the input contains at least one letter followed by a $*.$ Note that the input could be such that only one of the two letters are present $($see the last two examples below$).$

Also note again that $*$ must be part of the input, i$.$e$.,$ its last symbol, as explained above.

THE TASK IS:

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

$$ cecccccddddd$*$ccdddccddccc

$$ ccdddd$*$ccdddd

$$ ceccccdddd $*$ ccdddccdcc

$$ c$*$c

$$ ddd$*$ddd

You can assume that the tape of your Turing Machine is a $2-$way tape, i$.$e$.,$ it is infinite $($unbounded$)$ in both directions.

My Turing Machine should not have more than $25$ states.

My Turing Machine should not be non$-$deterministic.

Note: JFLAP should be used to draw my Turing Machine.