a. Construct DFA of the language L = (the set of all strings with three consecutive 1's), = (0,1) (1's not necessary at the end or beginning). b. Construct an NFA without Atransitions and with a single final state that accepts L = = (L = (a) U L = {b": n > 0)) < C. Find DFA for the following language on = (a, b). < L = {w: lwlmod 5 = 0}