(a) (1 point) Let L be a regular language. Is the corresponding DFA unique? (b) (1 point) Given a DFA (Q, 2, 8, 40, F). What is the meaning of 8(90,1) 92? (c) (1 point) Given any DFA with exactly one accept state, must it always recognize a finite language? (d) (1 point) If an NFA of 5 states, not counting the initial state, is converted into a DFA using a powerset method, without any minimization what is the number of states in the DFA? is described as below, (e) (2 point) Given the NFA N= ({90,41,42}, {a,b}, 6,90, {92}), where what will be return by E(91) ? sa b 40 41 40 6 41 42 42 42 42 426 (I) (2 point) Given an NFA N, prove that there exists an NFA N' with one accept state that recognizes the same language as N