Let L_D be the set of all languages accepted by a PDA by final state and L_E the set of all languages accepted by empty stack. Which of the following is true?

(a) L_D = L_E
(b) L_D \(\supset\) L_E
(c) L_E = L_D
(d) None of the above