2. Using the bypass algorithm in the proof of Kleene's Theorem (Theorem 6 in the textbook), Lemma 2, convert the following TG into a regular expression. ba baa Consider the following two FAs, which will be used in the questions on the next page. Let L1 be the language accepted by FA1 and let L2 be the language accepted by FA2 a,b FA FA2 x2t 2. Using the bypass algorithm in the proof of Kleene's Theorem (Theorem 6 in the textbook), Lemma 2, convert the following TG into a regular expression. ba baa Consider the following two FAs, which will be used in the questions on the next page. Let L1 be the language accepted by FA1 and let L2 be the language accepted by FA2 a,b FA FA2 x2t