Consider the context-free grammars To show that a string is in L(Gi), we give a derivation of the string using the rules in Ri . For example, the derivation

1. (10 points) Consider the context-free grammars Gi-(S,T, a, b,c, R1, S) = ((S, T, X), {a, b,c), R25 where Ri is the set of rules containing and R2 is the set of rules containing To show that a string is in L(Gi), we give a derivation of the string using the rules in Ri. For example, the derivation proves that abcc E L(G1). a. Is the empty string in LG)? Is the empty string in L(G2)? b. Show that the string abbcce is in L(G1) by giving a derivation of it using the rules in R c. Show that the string abbcce is in L(G2) by giving a derivation of it using the rules in R2 d. Is L(G1) infinite? Is L(G2) infinite