please answer only if you know the right answer

Goal is to design a DFA to accept the regular expression: (a+ba)* Design a DFA that has three states: S (start state and final state), state 1, state 2 Complete the DFA by filling up the blanks below. The edge can either be a or b or a,b or x (if there is no edge between the states) The edge from - S to S is - S to 1 is - 1 to S is - 1 to 2 is - 2 to 2 is - There is no edge from 2 to 1 - There is no edge from S to 2