and 1 Complete the fissing espes. The edge can be eicher one of the three postbilles a or b or a b Edge frem 5 to 5 is Fige frore S at is 1 is Edge from 1 to 1 is Edge from 1 to 5 in QUESTtoN 5 Design a DFA for regular expression b(a+b)*b that has four states: S (start state), 1, 2, and 3 (final state) Complete the missing edges of the DFA. The edges can be one of the following three labals: a or b or a,b Edges: S2is51is11is13is33is31is22isa,b QUESTION 6 If L={a,ab, which of the following strings is not a part of L You wil design a DFA that accepts serings over the alphabet is (a,b) ach that string contains even number of abs. The DFA has 2 stabes: 8/s start stale and fhal ealak and 1 Complese the mising edges. The edge eae be either one of the tree possibilites a or b or ab Edge from 5 lo 5 in Edge from 8 to t is Edge freen 1 to 1 is Fige from 1 to 8 is QUESTION 5 Complete the tisisig edges of the DFA. The edges can be one of ite folowing thee labels a of b of ab: and 1 Complete the fissing espes. The edge can be eicher one of the three postbilles a or b or a b Edge frem 5 to 5 is Fige frore S at is 1 is Edge from 1 to 1 is Edge from 1 to 5 in QUESTtoN 5 Design a DFA for regular expression b(a+b)*b that has four states: S (start state), 1, 2, and 3 (final state) Complete the missing edges of the DFA. The edges can be one of the following three labals: a or b or a,b Edges: S2is51is11is13is33is31is22isa,b QUESTION 6 If L={a,ab, which of the following strings is not a part of L You wil design a DFA that accepts serings over the alphabet is (a,b) ach that string contains even number of abs. The DFA has 2 stabes: 8/s start stale and fhal ealak and 1 Complese the mising edges. The edge eae be either one of the tree possibilites a or b or ab Edge from 5 lo 5 in Edge from 8 to t is Edge freen 1 to 1 is Fige from 1 to 8 is QUESTION 5 Complete the tisisig edges of the DFA. The edges can be one of ite folowing thee labels a of b of ab