G1 is a context-free grammar with start symbol S1, and no other nonterminals whose name begins with "S." Similarly, G2 is a contextfree grammar with start symbol S2, and no other nonterminals whose name begins with "S." S1 and S2 appear on the right side of no productions. Also, no nonterminal appears in both G1 and G2.

We wish to combine the symbols and productions of G1 and G2 to form a new grammar G, whose language is the union of the languages of G1 and G2. The start symbol of G will be S. All productions and symbols of G1 and G2 will be symbols and productions of G. Which of the following sets of productions, added to those of G, is guaranteed to make L(G) be L(G1) [union] L(G2)?

a) S S₁ | S₃, S₃ S₂

b) S S₁S₂, S₁ , S₂

c) S S₁S₃, S₃ S₂

d) S S₁, S₁ S₂, S₂

Would you plz explain me? will learn for my knowldge