Find finite-state automata that recognize these sets of strings of 0s and 1s.
a) the set of all strings that start with no more than three consecutive 0s and contain at least two consecutive 1s
b) the set of all strings with an even number of symbols that do not contain the pattern 101 c) the set of all strings with at least three blocks of two or more 1s and at least two 0s