The formal definition of a DFA M is ({q_1,q_2,q_3,q_4,q_5},{u,d}, delta, q_3,{q_3}), where delta is given by the following table: Give the state diagram of this machine. (do as many as you want) For each of the following languages, construct a DFA that accepts the language. Assume Sigma = {0,?1} {w| the length of w is divisible by three} {w|w contains at least five 1s} {w|w contains the substring 1011} {w|w contains at least two 1s and at most two Os} {w|w contains an odd number of 1s or exactly two 0s} {w|w begins with 1 and ends with 0} {w| every odd position in w is 1} {w|w has length at least 3 and its third symbol is 0} {epsilon, 0}