Q. 2 Maximum score 15 somewhere preceding, or (b) end in 101 and have 100 somewhere preceding Q. 3 Maximum score 12 Design an NFA to accept the set of strings of 0's and l's that either (a) end in 010 and have 011 Give an NFA for the following expression: ((aaUb)*(aba)*bab)*. Simplify the expression if you can Q.4 Maximum score 13 Write a regular expression for the language recognized by the following DFA Q5 Maximum score 25 {part (a) 5 points, part (b) 20 points] Consider an NFA defined by the following transition table {1} {3} {2,4} 1 {5} {5} {4) (a) Convert this table to the corresponding table for the NFA without transitions (b) Convert the resulting NFA into DFA