1.18 please

1.16 Use the construction given in Theorem 1.39 to convert the following two nondeterministic finite automata to equivalent deterministic finite automata. (a) (b) 1.17 a. Give an NFA recognizing the language (01001010). b. Convert this NFA to an equivalent DFA. Give only the portion of the DFA that is reachable from the start state. 1.18 Give regular expressions generating the languages of Exercise 1.6. 1.16 Use the construction given in Theorem 1.39 to convert the following two nondeterministic finite automata to equivalent deterministic finite automata. (a) (b) 1.17 a. Give an NFA recognizing the language (01001010). b. Convert this NFA to an equivalent DFA. Give only the portion of the DFA that is reachable from the start state. 1.18 Give regular expressions generating the languages of Exercise 1.6