##### Gate1999_1.6

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

(a) LD = LE
(b) LD $\supset$ LE
(c) LE = LD
(d) None of the above