4 Q1: A language is regular ifSelect all that apply. itis a non-empty set of strings over an alphabet All strings in the langauge are accepted by a DFA and this DFA accepts nothing not in the langauge All strings in the langauge are accepted by an NFA and this NFA accepts nothing not in the langauge. it is the empty set Q2: Which of the following are regular languages? Select all that apply.
OR
OR