Exercise 2 or each question, give a DFA accepting the specified language over the alphabet (0,1): a. The set of all strings ending in 11 b. The set of strings with 100 as a subsrting. Exercise 3 Convert the regular expression 00 (0+1) to a DFA. Show all the details of your work. Exercise 4 Consider the following e-NFA q3 Pr 0 py Ir! a. b. c. Compute the e-closure of each state. Give all the strings of lengths three or less accepted by the automaton. Convert the automaton to DFA