Consider the language $L=\{x^{n}y{z}^{2n}$:ninN$\}$ over the alphabet $\{x,y,z\}.$

Match the blue transition labels T$1$ to T$9$ in the diagram with the correct symbols so that the depicted diagram becomes a Turing machine that accepts the

language L$.$

You can assume that the input strings on the input tape are surrounded by blanks B$.$

You can also assume that the tape head starts on the first symbol of the input string.

Hint: Use a strategy where $x$ is replaced by a blank on the left side of the input string, and a matching pair of $z$ is replaced by blanks on the right end.