(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 leftmost two symbols are identical to the rightmost two symbols