Let T be a Turing Machine that decides the following language L$1$ over the

alphabet $\{0,1\}.$

L$1=\{$w $|$ w is string of at least length $3$ and contains twice as many $0$s and $1$s$\}$

For example, T will accept strings such as $001,100,010,010100,011000,$ etc.,

but it will reject strings such as $000,011,111,1100,0010,00011,00001,$ etc.

Please use Morphett's Turing Machine Simulator to write a code that implements this turning machine, taking into account these guidelines:

Syntax:

$1.$ Each line should contain one tuple of the form $\text{'}\text{'}.$

$2.$ You can use any number or word for and $,$ eg$.10,$ a$,$ state$1.$ State labels are case$-$sensitive$.$

$3.$ You can use almost any character for and $,$ or $\text{'}\_\text{'}$ to represent blank $($space$).$ Symbols are case$-$sensitive$.$ You can't use $\text{'}$;$\text{'},\text{'}*\text{'},\text{'}\_\text{'}$ or whitespace as symbols.

$4.$ should be $\text{'}$l$\text{'},\text{'}$r$\text{'}$ or $\text{'}*\text{'},$ denoting 'move left', 'move right' or $\text{'}$do not move', respectively.

$5.$ Anything after a $\text{'}$;$\text{'}$ is a comment and is ignored.

$6.$ The machine halts when it reaches any state starting with 'halt', eg$.$ halt, halt$-$accept.

Also:

$1.\text{'}*\text{'}$ can be used as a wildcard in or to match any character or state.

$2.\text{'}*\text{'}$ can be used in or to mean $\text{'}$no change'.

$3.\text{'}!\text{'}$ can be used at the end of a line to set a breakpoint, eg $\text{'}1$ a b r $2!\text{'}.$ The machine will automatically pause after executing this line.

$4.$ You can specify the starting position for the head using $\text{'}*\text{'}$ in the initial input.