Posted this last time and it wasn't answered properly I do not have a lot of questions left so please only answer if you know the subject

Answer (3-A), (3-B) and (4) using knowledge from Computer Science Automata's class (on languages and nfa/dfa). Use the reference link to get an idea on what I am looking for it will help you so use it - https://files.fm/u/htyjq524

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

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) (a u a2)* (au a) (b) over the alphabet fa) over the alphabet (0,1) (01)* u(10)*) 1* (01 u10)*