Problem $2$

Create a Turing Machine $M$ in JFLAP that accepts

$L=\{\begin{array}{ccc}\text{w}\text{i}\text{n}& \{a,& b{\}}^{+}\text{:}|w|4\\ w\end{array}$ has exactly one $b$ and

it occurs in the last $4$ characters of $w\}$

$[$Hint: See Example $1$ in Chap$9\mathrm{.}1$ Part$2$ Power Point slides. $]$

Use JFLAP to test M with input strings:

aabaa, aaaaba $,$ aaaab, aabaaa, aab, baaa, abaaaa $,$ abaab, bbbb

Give an instantaneous description trace of $M$ with input $w=$aaaba that shows that winL$(M).$ Do not use JFLAP to create the instantaneous description trace of $M.$

Submit the JFLAP diagram for the Turing Machine M$.$ Submit the JFLAP test case. Submit the typed instantaneous description trace of M$.$ Do not use JFLAP to create the instantaneous description trace of $M.$