Suppose alphabet E= {0,1}, design a DFA (draw its state diagram) to recognize each of the following languages: (1) {w\w contains an even number of Os } (2) {w\w at most one 1 } (3) {w\w contains the...

Extracted text: Suppose alphabet E= {0,1}, design a DFA (draw its state diagram) to recognize each of the following 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) {w| each 0 in w is followed by at least one 1 } (5) {w\w contains either the substrings 01 or 10 }