Which one of the following is/are TRUE?
1
Compliment of every context-free language is recursive
2
There is a unique minimal DFA for every regular language
3
Every non-deterministic PDA can be converted to an equivalent deterministic PDA
4
Every NFA can be converted to an equivalent PDA