Construct DFA's that recognize the following languages. Showing state diagrams will be sufficient. (The alphabet is {0,1} unless otherwise specified.) a. {w ∈ {0,1}* | w begins with a 1 and ends with a 0}
b. {w ∈ {0,1}*| w contains the substring 010}
c. {w ∈ {0,1}* | w does not contain the substring 010}