L$=\{$ww:win$\backslash$Sigma $^(+)\}$

Construct a Standard Turing Machine M such that

L$($M$)=$L$.$

Save your Standard Turing Machine as a JFLAP file, and

submit that file to Canvas as your solution to this exercise.

suppose that w$=$ab$.$ Then, ww$=$abab. In this case, the tape$$s contents could go through the following evolution, top$$to$$bottom reflecting the tape$$s contents as time progresses $...$

abab$$Tape$\text{'}$s initial contents$$xbab$$After changing leftmost a to x$$xbay$$After changing rightmost b to y$$xyay$$After changing leftmost b to y$$xyxy$$After changing rightmost a to x$$ At this point in processing, the read$-$write head can be positioned over the leftmost symbol in the second half of the string. All symbols from there to the right could be changed back to $\backslash ($ a $\backslash )\text{'}$s and $\backslash ($ b $\backslash )\text{'}$s$,$ after which, the tape's contents would look like this $...$

$\backslash (|\backslash$mathrm$\{$x$\}|\backslash$mathrm$\{$v$\}|\backslash$mathrm$\{$a$\}|\backslash$mathrm$\{$b$\}\backslash$mid $\backslash$leftarrow $\backslash )$ After restorina $\backslash ($ a $\backslash )\text{'}$s and $\backslash ($ b $\backslash )\text{'}$s in second half of strina

Next, one could match each $\backslash ($ x $\backslash )$ in the left half of the string to an $\backslash ($ a $\backslash )$ in the second half, and match each $\backslash ($ y $\backslash )$ in the left half with a $\backslash ($ b $\backslash )$ in the second half. The tape's contents would go through the following evolution $...$

If all such matching succeeds, the original input string can be accepted. If there arises a situation in which such matching cannot be done, the original input string can be rejected.