Problem $3$

a$.$ Design a TM M that accepts

$L=\{a^{n}c{b}^n$:$n1\}.$ Requirement: Do this by modifying Example $2$ from the Chap $9\mathrm{.}1$

Part $2$ Power Point slides. You must use the zig$-$zag method. Give a high level English

description of how you modified Example $2$ and justify why it should work.

b$.$ Use your design in Part a to create a TM M in JFLAP that accepts $L=\{a^n{c}^n.$:$n1\}$

c$.$ Use JFLAP to test the strings:

aacbb, aaacbbb, aaccbb, aaaabbbb, abbca, aacbbb, aaacbb, c$,a^5{c}^5$

d$.$ Give an instantaneous description trace of $M$ with input $w=$aacbb that

shows that winL$(M).$ Do not use JFLAP to create the instantaneous

description trace of M$.$Example $2$ : Turing Machine that accepts $L=\{a^n{b}^n$:$n1\}$