for G production rules are: S → bSb | AcA Ab → A, Ab → b, bA → b s -> bSb ->bbSbb ->bbAcAbb ->bbAcAb ->bbcAb ->bbcb // we can observe that on left of c we have got more no. of b's So, L(G) = {b^{n}cb^{m} | n>=m} , which is a context free language. For G' , production rules are as follows: S → bSb | AcA Ab → A, Ab → b, bA → b , bA → A S -> bSb ->bbSbb ->bbAcAbb ->bbAcAb ->bbAcb ->bbcb // we observe that on left and right of c , we have got unequal no. of b's So, we can say that L(G') is a regular language. Ans is (B)

for G production rules are: S → bSb | AcA Ab → A, Ab → b, bA → b s -> bSb ->bbSbb ->bbAcAbb ->bbAcAb ->bbcAb ->bbcb // we can observe that on left of c we have got more no. of b's So, L(G) = {b

^{n}cb^{m}| n>=m} , which is a context free language. For G' , production rules are as follows: S → bSb | AcA Ab → A, Ab → b, bA → b , bA → A S -> bSb ->bbSbb ->bbAcAbb ->bbAcAb ->bbAcb ->bbcb // we observe that on left and right of c , we have got unequal no. of b's So, we can say that L(G') is a regular language. Ans is (B)we can get equal no of b's on either side of c too in G'