Please show all the steps. Thank you

Build a DFA (Deterministic Finite Automaton) that recognizes the language defined by the regular expression a*(b/c)^+ a c b* specify your DFA by extending the state transition diagram below. The start state is state 1, and the final (accepting) state is state 4. are only allowed to add edges with their appropriate labels, i.e., valid labels are a, b, and c. Note that an edge may have more than one label. You may decide not to use state 2 and/or state 3, but you must not add any states