(4) Given the alphabet as {0, 1}, write a DFA for the following three regular languages. (Give the complete description of the DFA with transition function as a table and also as a transition graph) (i) L = {w | w is a string of even length} (ii) L = {w | |w| mod 3 = 0} (iii) L = {w | w contains the string 001 as a substring} (iv) L = {w | w does not contain two consecutive 1's}