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

Try to design an optimal DFA, i$.$e$.$ Avoid adding unnecessary states.

a$.(0$ U $1)000(0$ U $1)$

b$.(((00)(11))$ U $01)$