design and implement a DFA, which can recognize the regular expression 1:(00|011)11. (The entire process for constructing the DFA, 1. such as the NFA generation from the regular expression [explain every step in detail]} 2. the conversion from the NFA to its equivalent DFA (if necessary). 3. 3. The final DFA should also be illustrated in both the transition table and the transition diagram. 4. Explain the steps for your transition tables and transition diagrams with detail