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

$-$ Accepts all words in $\{()+1|>=1\}$

$-$ Loops forever on all words starting with b

$-$ Rejects all other words

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

Hint: Write your solution out as high$-$level pseudocode before you start drawing your TM