Theory of Computation: Decidability, Reduction,

Let E_PDA = { | M is a Push Down Automata (PDA) where L(M) = ? }.

Prove that the language E_PDA is decidable.