Using Arden's lemma and forward construction, generate regular expressions corresponding to the languages

accepted by each of of the NFAs below $($from Homework $3).$

$(\{q_1,q_2,q_3,q_4\},\{0,1\},,q_1,\{q_4\}),$ where $$ is defined by the following table:

$(\{q_1,q_2,q_3\},\{a,b\},,q_1,\{q_2\}),$ where $$ is defined by the following table: