Design a two$-$tape Turing Machine for following the language:

L $=\{$a$^$nb$^2$nc$^$n$\},$n $1,=\{$a$,$b$,$c$\}.$

You must use the second tape and leave the input in its original condition; however, you may do what you want with the second tape. You can use the stay option, in addition to left and right.

Note: You MUST use JFLAP for this question as it specifically designed for it$.$

Must Provide:

$1.$the algorithm used

$2.$the JFLAP Multi$-$Tape Turing Machine screenshot, including$$each states' meaning using the "Change Label" option in JFLAP

$3.$Show screenshot of at least $10$test cases in JFLAP $($valid and invalid$)$to fully prove that the Turing Machine is fully functional.

$4.$a detailed description of whether the Turing Machine works or not, and if not, to what extent.