4. Designing DFAs and NFAs. [10) For each of the following languages over the alphabet (0, 1), give a DFA and an NFA that accept the language. Note: For a string w over alphabet 0,1), no() is the number of zeros in string w, ni(w is the number of ones in string w. (a) The set of strings given by {w(w E {0, 1)", n 1(w) mod 2 = 0). (b) The set of strings given by {w E {0, 1)", length of w is odd). (c) The set of strings given by (10wO1 w E 0, 1