Create a two$-$tape Turing machine for $\backslash ($ L $=$ www $\backslash )$ where $\backslash ($ w $\backslash$in $\backslash \{$a$,$ b$\backslash \}^*\backslash ).$

$**$Initial Conditions $($for both types of machines$)$:$**$ The input string is already on the first tape while the second tape is empty; and the head of the first tape is on the first symbol of the input string.

$**$Final Condition:$**$ The position of the head is not important, halt if the string is accepted, crash if the string is not accepted.

The language described by the language consists of strings where the substring w is repeated three times consecutively.

Example of valid inputs:

aaa $($where w $=$ a$)$

bbb $($where w $=$ b$)$

ababab $($where w $=$ ab$)$

Below is the single$-$tape version of this Turing machine, please convert it to the double$-$tape version.