Find a grammar G = (V,T,S,P) that generates the language recognized by this automaton. Mark the correct answer. Start b S4 Sg Se So S1 16 b a a a, b a,b O V = {a,b,B,S}, T={a,b], P = {S-A, 5+Babab, B-a, B-b} V = {a,b,A,S}, T={a,b}, P = {S-, S-Aabab , A+, A-b} V = {a,b,S}, T={a,b], P = {S+Sabab, S-a, 5-b} O V = {a,b,A,B,S}, T={a,b}, P = {S-XS, S Sab} V = {a,b,S}, T={a,b], P = {S-ababs, S-a, 5-b} V = {a,b,A,B,S}, T={a,b], P = {5+, 5-aA, AB, B-ab}