A push down automata can be represented as:

• A. PDA= ε-NFA +[stack]State true or false:
• B. true
• C. false