Use the construction given in the proof of the Theorem below to give the state diagrams of DFAs recognizing the union (Union as shown, not all 4 at the same time) of the languages described in:

Proof of Theorem:

Thank You

a. ww begins with a 1 and ends with a o) a. b. sw| w contains at least three 1s) {w| w contains the substring 0101 (i.e., w = z010!y for some x and y)} fw| w doesn't contain the substring 110] c. f