Use Arden's lemma,

4. Derive a regular expression using the algebraic method for the language recognized by the fol- lowing DFA: b b 1 2 1 a 3 4 b a.b a Show work clearly. Arden's Lemma: An equation of the form X = AX UB, where e A, has unique solution X =AB