On your paper, construct an equivalent regular expression for the given automaton, using the standard procedure and templates as seen in class and in the textbook. Process not product. automaton. Simplify your regular expressions to remove unnecessary 's or s. (a) When eliminating state 1 , what are the values for the parts of the update formula for the expression labelling the arc between state 0 and state 2 ? Ri,j(before)=SiU=Tj= (b) What is the label on the arc between state 0 and state 2 after this step? Ri,j(after)= (c) With the automaton reduced to just two states, what are the values of the parts of the final equivalent regular expression? As a reminder, the template for this is: S=T=U=V= a. x b. xy c. xy d. xy