Problem #$3.$ Following the subset construction, construct for each of the following

NFAs an equivalent DFA:

Problem #$4.$ Using the construction described in class, construct for each of the

following regular expressions an equivalent NFA : $(1)((aba{)}^{*}b+b^{*}{a}^{*}{)}^{*}$

$(2)ba(ba{)}^{*}+b^{*}ba{b}^{*}$

Problem #$5.$ Following the construction described in class, give an equivalent regular

expression for each of the following NFAs: $($provide all intermediate steps$)$