. 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:

1. (a² a³)* ( a²) over the alphabet {a}

(b) ((00)* (01)*) (00 01)* over the alphabet {0,1}