Only solve (III) Describe the extended....

(1) Give a formal definition with any notations for the following: DFA as a 5 tuple, Language accepted by automaton, Regular language (II) 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) (0) L = {w I w is a string of even length} (ii) L = {w I lwl mod 3 = 0} (iii) L = {w I w contains the string 001 as a substring} (iv) L = {w l w does not contain two consecutive 1's} (1) Describe the extended transition function on a string recursively using transitions one symbol at a time for the automaton of the above problems. (i) A string (of length >=4) that belongs to the language (II) A string (of length >=4) that does not belong to the language