A language is accepted by a push down automata if it is:

• A. regular
• B. context free
• C. both (a) and (b)
• D. none of the mentioned