Which of the following assertion is false?

• A. If L is a language accepted by PDA1 by final state, there exist a PDA2 that accepts L by empty stack i.e. L=L(PDA1)=L(PDA2)
• B. If L is a CFL then there exists a push down automata P accepting CF; ; by empty stack i.e. L=M(P)
• C. Let L is a language accepted by PDA1 then there exist a CFG X such that L(X)=M(P)
• D. All of the mentioned