Let $L2=$ The language of strings with alphabet $\{a,b,$;$\}$ in the format $x1$;$x2$;dots;$xn$ where each $x$ is a

string of $\{a,b\},$ and each string occurs exactly twice.

Problem $4$

Write a Turing Machine that accepts L$2.$