Give a finite automaton that recognizes the language described by the following regular expressions. For all parts, the alphabet is {a, b}. Use the construction from Kleenes Theorem for at least on of these. (you can do them using both Kleenes Theorem and from scratch if you want more practice).

9. Give a finite automaton that recognizes the language described by the following regular expressions. For all parts, the alphabet is ta, b Use the construction from Kleene's Theorem for at least on of these. (you can do them using both Kleene's Theorem and from scratch if you want more practice). (a) a (b) a(ba) b (c) (aaa) (d) aba u bab (e) (((aa) (bb)) U ab)