Is the following correct?

To convert a DFA into an equivalent PDA, replace every transition in the transition diagram of the DFA by a transition between the same pair of states in the PDA while not pushing or popping characters from the stack.

Group of answer choices

It is correct because DFAs are a type of PDAs that ignore the stack.

It is correct because DFAs and PDAs recognize the same class of languages.

It is not correct because there is a regular language that is not recognized by a PDA.

It is not correct because PDAs do not have transition diagrams.