Example: convert the following reqular expression to finite automata. (a) (ab) a (b) ((a + b)+ ba)* b a

Example: Convert the following reqular expression to finite automata. (a) (ab) a (b) ((a + b)+ ba)* b a please explain me how these conversion from regular expression to automata is done.