$,$ Consider the following nondeterministic Turing Machine

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

$(())(())$

$2xxr2$

$2axr3$

$2bxr3$

$(())(())(())$

$(5$ marks$)$ State five strings that are in $L(N),$ and five that are not. The

strings should be over $.$

$(5$ marks$)$ 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$.$