LUUU 21 (1) Build a DFA which only accepts the following languages on = {a,b}: (a) L = {w: mod 5 +0) (b) L = {w: n.(w) mod 3> 1} (2) Build a DFA which only accepts the following languages on = {0,1}: (a) The set of all strings in which every 0.0 is followed immediately by a 1. For example the string 1.0.1, 1.0.0.1, 0.0.1.1, 0.0.1.1.0.1.0.0.1 are in the language, but 0.0.0.1 and 0.0.1.0.0 are not. (b) The set of all strings with the left most two symbols are identical to the right most two symbols. (3) Let { [8 8 8 0 0 0 01:0) A string of symbols in gives three rows of 's and i's. Consider each row to be a binary number. Build a DFA which only accepts the language L-{we: the bottom row of w is the sum of the top two rows. Hint: Working with LR is easier. (LR is the reversed language that accepts the reversed sentences of L. Also, the string "ab.c" is the reverse of "c.b.a")