Question 1 (25 points) el Construct an e-NFA X with not more than 5 states that accepts the language ponding to the regular expression E = ((0.1)*+1*)*. Carefully specify the initial and the final states of X. (6 pts) Construct an NFA Y (without e-transitions and with the same states as those of X) t is equivalent to X. Carefully specify the initial state(s) and the final state(s) of Y c)(7 pts) Compute a DFA Z that is equivalent to Y. (6 pts) Compute a minimal state DFA W that is equivalent to Z. Try to express the language wmbolized by E in a simple natural language