Only a) and b) option please. Formal Languages and automata theory, regular languages.

Consider the regular expression E = (1 + 0)*. 1. (1 + 0)* + 1.0* Construct an e-NFA (preferably with not more than 5 states) that accepts the language L_E represented by the regular expression E above. Derive an e-free NFA that accepts the language L_E Derive a DFA that accepts the language L_E. Derive a minimal state DFA that accepts the language L_E