For the above grammar, if you rewrite the grammar to eliminate left recursion, that is, provide a grammar G2 such that L(G1)=L(G2) but G2 admits no derivation X -->* Xa. Select which of the following represents G2 S--> E E --> F int E --> (E) F-> + E|- E | E S --> E E --> int F E --> (E) F F--> + E|- E | E S --> E E --> Fint F E--> EF F --> + E | - E All of the above For the above grammar, if you rewrite the grammar to eliminate left recursion, that is, provide a grammar G2 such that L(G1)=L(G2) but G2 admits no derivation X -->* Xa. Select which of the following represents G2 S--> E E --> F int E --> (E) F-> + E|- E | E S --> E E --> int F E --> (E) F F--> + E|- E | E S --> E E --> Fint F E--> EF F --> + E | - E All of the above For the above grammar, if you rewrite the grammar to eliminate left recursion, that is, provide a grammar G2 such that L(G1)=L(G2) but G2 admits no derivation X -->* Xa. Select which of the following represents G2 S--> E E --> F int E --> (E) F-> + E|- E | E S --> E E --> int F E --> (E) F F--> + E|- E | E S --> E E --> Fint F E--> EF F --> + E | - E All of the above