In a formal language theory, context free grammer is accepted by :

• A. Pushdown automata
• B. Finite automata
• C. Two way bounded automata
• D. Both a and c