Which of the below statements about (deterministic) pushdown automata ((D)PDA) and context free languages (CFL) is true?

1.None of the above.

2.For any arbitrary PDA, there is an equivalent DPDA accepting the same language;

3.The complement of an arbitrary language accepted by a DPDA can be accepted by a DPDA

4.The intersection of any two CFLs is also a CFL;

5.The complement of an arbitrary language accepted by a PDA can be accepted by a PDA;