Consider the following deterministic finite$-$state automaton.

Find a grammar G $=($V$,$T$,$S$,$P$)$ that generates the language recognized by this automaton.

Mark the correct answer.

V $=\{$a$,$b$,$A$,$B$,$S$\},$ T$=\{$a$,$b$\},$ P $=\{$S$->$lambda $,$ S$->$aA $,$ A$->$bB$,$ B$->$ab$\}$

V $=\{$a$,$b$,$S$\},$ T$=\{$a$,$b$\},$ P $=\{$S$->$Sabab, S$->$a$,$ S$->$b$\}$

V $=\{$a$,$b$,$B$,$S$\},$ T$=\{$a$,$b$\},$ P $=\{$S$->$lambda $,$ S$->$Babab, B$->$a$,$ B$->$b$\}$

V $=\{$a$,$b$,$A$,$B$,$S$\},$ T$=\{$a$,$b$\},$  P $=\{$S$->$lambda S$,$ S$->$Sab$\}$

V $=\{$a$,$b$,$S$\},$ T$=\{$a$,$b$\},$ P $=\{$S$->$ababS, S$->$a $,$ S$->$b$\}$

V $=\{$a$,$b$,$A$,$S$\},$ T$=\{$a$,$b$\},$ P $=\{$S$->$lambda $,$ S$->$Aabab $,$ A$->$a$,$ A$->$b$\}$

Start So a b S 67 a $2 $5 a,b a 59 a, b S4