Design a Turing machine M that decides the language L $=\{0$n$1$n $|$ n $0\}.$

$(1)$ Give a high level description of$$M$$in English.

The following is an answer to this question. Please verify its correctness.

Move right.

If the current symbol is the blank symbol, halt and accept.

Loop:

$3\mathrm{.}1.$ If the current symbol is $0,$ change it to $ and move right. Otherwise exit loop.

$3\mathrm{.}2.$ Scan rightwards, past $0$s and #$$s to find $1.$

$3\mathrm{.}3.$ If $1$ found, change it to # and move left. Otherwise reject.

$3\mathrm{.}4.$ Scan leftwards, past $0$s and #$$s to find $$.$

$3\mathrm{.}5.$ When finding the first $$,$ move right, and go back to $3\mathrm{.}1.$

If the current symbol is #$,$ more right. Otherwise reject.

Scan rightwards, past #$$s$,$ to find the blank symbol.

When finding the first blank symbol, move right and accept.

Group of answer choices