Problem 1 (6 points) a. Construct DFA of the language L {the set of all strings with three consecutive 1's), E = (0,1)(l's not necessary at the end or beginning). b. Construct an NFA without A transitions and with a single final state that accepts L = {21 = {a} U L2 = {b": n >0}} Find DFA for the following language on E = {a,b}.- {w: /w|mod 5 = 0}+ C. L =