State whether True or False.I. For every language L accepted by an NFA, there exists a DFA that also accepts L.II. For every alphabet ∑, every regular language over ∑ can be accepted by a finite automaton.

• A. I – True, II - True
• B. I – True, II – False
• C. I – False, II – True
• D. I – False, II – False