Use the standard process we saw in class to derive an NFA from the RE (a | b)* ba, and then use the subset algorithm to give an equivalent DFA. Either formalizing the DFA/NFA or diagramming them clearly will be sucient. The nal DFA should be labled with sets of NFA states. Please show steps. Thanks.