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

$**$Initial Conditions:$**$ 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.

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