Use the procedure described in $\text{Lemma 1.60}$ to convert the following finite automata to regular expressions.

using state elimination method

a.

b.