Problem $1$

a$.$ Input the Turing Machine M in JFLAP from Example B in the Chap $9\mathrm{.}1$ Part$1$ Power

Point Slides $($slide $24)..$ Note that L$($M$)=\{$w in $\{$a$,$b$\}+$; w contains at least one b$\}.$

b$.$ Use JFLAP to test the strings: aaab, baba, aaabaaa, aabcbb, aaaabaa

c$.$ Give an instantaneous description trace of M with input w $=$ aaabaa. Do not use JFLAP to create the instantaneous description trace of M$.$