Design a DFA that recognizes the same language as the following Regular Expression.

Try to design an optimal DFA.

This is for the design, so Please provide the design $($don$\text{'}$t need the explanation$)$

$(01)*000(01)*$

$(((00)*(11))01)*$