Please provide an explanation for steps to arrive to solution.

Consider language A with CFG G S rightarrow Cda | CD C rightarrow aD D rightarrow Sb | b a. Show that any sufficiently long string s in A can be pumped and remain in A. parse tree for s. [s = ababbba A] b. Split the string, s= uvxyz into 5 pieces based on repeated variable: Consider language A with CFG G S rightarrow Cda | CD C rightarrow aD D rightarrow Sb | b a. Show that any sufficiently long string s in A can be pumped and remain in A. parse tree for s. [s = ababbba A] b. Split the string, s= uvxyz into 5 pieces based on repeated variable