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

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

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

Move right.

Loop:

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

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

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

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

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

If the current symbol is #$,$ move 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

The provided answer is correct.

The provided answer is incorrect.