Part $5$

Problem $5(10$ points$)$: Draw a PDA with at most $8$ states that accepts the language:

$\{a^{2n+1}b{c}^n|ninN\}$

You may use JFLAP notation or textbook notation. PDA acceptance should be the same as we did in class, i$.$e$.$ it is based on string consumption and final$-$state acceptance.

Note: it is possible to draw this PDA with fewer than $8$ states, but you are allowed to use at most $8$

Draw your PDA in this box

Fill in the initial symbol on your stack $($usually X or Z$)$ Here: $q,$

$($This isn't trying to trick you, just to make sure I know what you're doing!$)$