Kleene's theorem should be used to find a regular expression that generates the language accepted by the following TG (Transition Graph): O 1. O 2. O 3. | 8 O 4. bb aa 9⁰ a In the process, states are eliminated until only the start and final states are left with an edge connecting them and with a label that represents the required regular expression. Which one of the following is the result of eliminating state q3? - 9⁰ bba 91 aa 0·8·0 aa bb 91 abb a 93 aa + bba aa bbbb aa 0-8-0 aa bb 91 bb+a a+bb bb bb+(aa)*+bb bba+(aa)* 91 bb 91 bb + abb + 92 bb+(aa)*+bb bb a(aa)*+bb 92 + 92 92 + 92

Kleene's theorem should be used to find a regular expression that generates the language accepted by the following TG (Transition Graph): O 1. O 2. O 3. | 8 O 4. bb aa 9⁰ a In the process, states are eliminated until only the start and final states are left with an edge connecting them and with a label that represents the required regular expression. Which one of the following is the result of eliminating state q3? - 9⁰ bba 91 aa 0·8·0 aa bb 91 abb a 93 aa + bba aa bbbb aa 0-8-0 aa bb 91 bb+a a+bb bb bb+(aa)+bb bba+(aa) 91 bb 91 bb + abb + 92 bb+(aa)+bb bb a(aa)+bb 92 + 92 92 + 92