The languages accepted by NPDA (Non-Deterministic Push Down Automata) are not accepted by DPDA (Deterministic Push Down Automata)
But, the languages accepted by DPDA are accepted by NPDA.
∴ NPDA is a superset of DPDA
and hence, NPDA is more powerful than DPDA.
∴ Statement 1 is true.
Now, in case of FA (Finite Automata), we know that an NFA (Non-Deterministic Finite Automata) can be converted to an DFA (Deterministic Finite Automata).
& an DFA can be converted to NFA.
So, DFA ≅ NFA
∴ Statement 2 is also true.
Option a) Both statements are true will be the answer.