This question is about the context-free grammar, please check each question and show all the steps.

2. (5 pts) Consider the CNF grammar G (V,T,S,P) where v={s. A. B. C. D }. T={a, b, c },s-sand P is given below. Use the CKY to determine if the strings wi babbc and w2-aaaabb are in the language L(G). If the string is in L(G) construct the parse tree