Are the following True or False. In either case, provide a justification for your answer.

a) Any PDA can be transformed into an equivalent FA.

b) Any nondeterminstic FA can be converted into an equivalent deterministic PDA.

c) Any language recognized by a PDA can be recognized by an FA.

d) If a language is recognized by some non-deterministic PDA, it cannot be recognized by a DFA.