Question 5 (: Given the following regular expressions, construct the corresponding nondeterministic finite automata using the method shown in the lectures. Represent the automata in the form of diagrams. You should simplify your models as you build them - for example you may remove redundant states and combine states that are linked with epsilon transitions, but make sure the language is unchanged. (You do not need to show every step of the conversion, but you should show some working beyond the final answer.) a) ((ba U ab) Ub)* b) a*b (a Ub)* ba