A language is accepted by a push down automata if it is:a) regularb) context freec) both (

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