Nondeterministic Turing Machine N over input alphabet $=\{$a$,$ b$\}$:

$0\_\_*$ halt$-$reject

$0$ a a r $0$

$0$ b b r $0$

$0$ b x l $1$

$1$ x x l $1$

$1$ a x r $2$

$1$ b x r $2$

$1\_\_$ r $4$

$2$ x x r $2$

$2$ a x r $3$

$2$ b x r $3$

$2\_\_*$ halt$-$reject

$3$ x x r $3$

$3$ a x l $1$

$3$ b x l $1$

$3\_\_*$ halt$-$reject

$4$ x x r $4$

$4$ a a $*$ halt$-$reject

$4$ b b $*$ halt$-$reject

$4\_\_*$ halt$-$accept

$1.$ State five strings that are in L$($N$),$ and five that are not. The strings should be over $.$

$2.$ Provide a low level description in Morphett notation of a $(1-$tape deterministic$)$ Turing Machine for the language.

Note: Morphett$$s simulator of nondeterministic TMs uses randomness to resolve nondeterminism. This is not the semantics of NTMs$.$