Consider the following DFA (M1) over the alphabet ? = = {0,1}: 91 1 0 93 42 Grafstate Consider the following NFA (N1) over the alphabet S = {0, 1}: State diagram for an NFA 0 E, 1 92 ,1 0 91 93 Grafstate {a,b}, write 1. For each of the following regular expressions over the alphabet = Grafstate code for an equivalent NFA: (a) (a Ub)*a (b) (ab U )a* (c) (a Ub)(a Ub)*