Suppose alphabet = {0,1}, design a DFA to recognize each of the following regular languages: (1) {w/w contains an even number of Os } (2) {w/w at most one 1 } (3) {w/w contains the substring 0101 } (4) {weach 0 in w is followed by at least one 1 } (5) {w/w contains either the substrings 01 or 10 }