Build a Turing Machine $($TM$)$ that

$$

accepts all words of the form bnam $|$ n $>$ m$,$ m $>=0,$

$$

loops forever on all words starting with a$,$ and

$$

rejects all other words.

$$

Assume that the alphabet is $\backslash$Sigma $=\{$a$,$ b$\}.$