Use the procedure described in Lemma $1\mathrm{.}60$ to convert the following NFAs to regular

expressions:

$($a$)$ start state $q_1,$ accepting state $q_2$

$($b$)$ start state $q_1,$ accepting state $q_2$

Show your work $($including GNFA and intermediate results after each state removal$).$