Using JFLAP 7.1, give a state diagram (with no more than 5 states) for a non-deterministic pushdown automata NPDA (Single Character Input/Accept by Final state) that recognizes the following language....

Using JFLAP 7.1, give a state diagram (with no more than 5 states) for a non-deterministic pushdown automata NPDA (Single Character Input/Accept by Final state) that recognizes the following language.

A= {w ∈ {a, b}∗ | the length of w is odd and the middle symbol is b }