(1) Give a formal definition with any notations for the following: DFA as a 5 tuple, Language accepted by automaton, Regular language (2)Describe the extended transition function on a string recursively using transitions one symbol at a time for the three automaton of the above problem. (i) A string (of length >=4) that belongs to the language (II) A string (of length >=4) that does not belong to the language