A context free grammar can be recognized by

• A. Push down automata
• B. 2 way linearly bounded automata
• C. Both (a) and (b)
• D. None of the mentioned