Maximum score 20 (part (a) 5 points, part (b) 15 points) Consider an NFA defined by the following transition table b 2 {2,4} 1 2 3 4 5 a {1} {3} {5} {5} {2} {4} eeee (a) Convert this table to the corresponding table for the NFA without transitions (b) Convert the resulting NFA into DFA. Q. 3 Maximum score 20 Design an NFA to accept the set of strings of 0's and I's that either (a) end in 010 and have 011 somewhere preceding, or (b) end in 101 and have 100 somewhere preceding