The Solution is 100% right. I just need step by step explanation.

Please explain each step I really do not know anything here.

3. Construct an nfa for each of the following regular expressions, then find the corresponding dfa, and then reduce this dfa, always using the constructions given in class: (a) (aa2)(a3a2) over the alphabet {a} (b) (0011)((11)(00)) over the alphabet {0,1} 3 (a) 1,28 is renaning for q1,q2q8 3(a) continued Corresponding DFA 3(b) continued corresponding DFA Reduced DFA