Hello! Please help me solve the problem below. Attached is Example B for part a$.$

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)=\{\begin{array}{ccc}\text{w}\text{i}\text{n}& \{a,& b{\}}^{+}\text{;}w\end{array}$ contains at least one $\{$:$b\}.$

b$.$ Use JFLAP to test the strings: aaab, baba, aaabaa, 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.$

Submit the JFLAP diagram for Turing Machine M$.$ Submit the JFLAP test case. Submit the typed instantaneous description trace of $M.$