1. Please design and implement a DFA, which can recognize the regular expression 1^*(00|011^*)^*00. Requirements:

1. Please submit the source code (in any programming language) of your DFA, which should be runnable and give correct output for a given input: given an acceptable string, the DFA should output accept; while given a non-acceptable string, the DFA should output an error message; (20 marks)
2. Please submit a report for your implementation, which should include the following information:

1. The entire process for constructing the DFA, such as the NFA generation from the regular expression, and the conversion from the NFA to its equivalent DFA. The final DFA should also be illustrated in both the transition table and the transition diagram; (10 marks)
2. Sample executions of at least two acceptable strings and two non-acceptable strings. Please demonstrate the executions in both the state transition sequences on your DFA transition diagram (for acceptable strings only), and the screenshots of the real executions (for both acceptable and non-acceptable strings). (10 marks)