Given are the two regular expressions $$ \begin{array}{1} \operatorname{RE) 1:=\left(\mathbf {a}^{*} \mathbf{b}^{*} ight)^{*} \operatorname{RE) 2:=\left(\mathbf{a}^{*} \mid \mathbf{b}^{*} ight)^{*} \end{array} $$ $$ \text { Prove that } L(R E 1)=L(R E 2) \text {, } $$ via their NFA, DFA, and Minimized DFA! - Construct the automata according to the techniques shown in Chapter #1. - Show the steps of the development: CS.VS. 1041|