6. A) Give the graphical representation of the following deterministic finite state automata with its transition function. K = (90, 91,92) = (0,1) (90) A = (92) Transition function: Present State Next State for Input 0 Next State for Input 1 70 72 92 41 B) Give the languages, and their natures (descriptions), generated by the following grammars 1) N = (S.A. B). = (a,b). Start symbol =S. P:S AB, A-a. B b. B-b ii) N = (S.A, B), = (a,b)}, Start symbol = S. P:S AB, AaAla, B bBlb 000