Apply the general algorithm for transforming the finite automaton into a regular language $($i$.$e$.,$ a language described by a regular expression$)$ to Automaton B from Problem $1\mathrm{.}4.$ For simplicity, assume that we only have symbols a$,$ r$,$ and A$.$ Eliminate first the r state, then the start state, and finally, the state n$\mathrm{.}1\mathrm{.}4.$ Automain $a_1{A}_1$dots