Take Test: MA http://bb.undedu/webapps/assessment take/la 0 6 Dedor Completion Status QUESTION 5 Given the following NFA, what string is accepted ? State 1 is the only final state. A None of the choices QUESTIONS widtshowing is the appropriate regular expression for the given Finite Automata? https://bb.und.edu/webapps/assessment take 0 do Completion Statut Abba obbaba OCA None of the choices QUESTION 9 Watch the language L (on the left side) with LL on the right side) A. LL={a aa } B. LL={bb,b,^} C. LL={aa, abb, bb QUESTION 10 D.LL={N} The following sa DEA designed for regular expression ba". Find proper labels for the transitions. OA 6:02:2, 11:a; 22:6; 2->2. a,b L={1,a} L={b} EYL=EN QUESTION 10 The following is a DFA designed for regular expression ba* Find proper labels for the transitions. Start 0 20 010->1:6; 0->2:2; 1->1:a; 1>2:6; 2->2:a, b OB 0->1:2; 0->2: 6:1->1: a; 1->2: b; 2->2: a b OC.O->:a: 0->2: a: 1->1: b: 1->2: b: 2->2: a b 0.0->1: 6:0->2:6; 1->1: a; 1->2:a, 2->2: a b QUESTION 11