Give DFAs that recognize the following languages, where = {0, 1}

(a) {w {0, 1} |w exactly three 1s}.

(b) {w {0, 1} |w contains 001 as a substring}.

(c) {11, 110} .

Use one of the DFAs that you constructed for the previous question (guess which one) to give a a DFA that recognizes the following language:

A = {w {0, 1} |w does not contain 001 as a substring}.