2. Construct a DFA for each of the following languages (a) All and only those strings over {a,b,c} whose symbols are in alphabetical order. For example, aaabcc and ac are to be accepted, and abca and ch should be rejected. (b) All and only those strings over {0,1} that have an even number of O's and the number of l's is a multiple of 3. (c) L = {anbm ck : n, m, k > 0, n + m + k is even } (d) L2 = {w e {a,b}* : w does not contain aab and w ends in bb}