Consider the CFG and Grammar. Please try to solve both but anything helps thank you

Question 1 (10 Marks)TANY ONE Consider the following CFG C ABC AB Derivation Trees Give a derivation for string "aaaaba" in L(G) "and" informally, describe the language described by the above CFG OR Consider the following CFG y ay | by l Show leftmost and rightmost derivations for aabab "and" . For any m, n>0, describe a derivation in G of the string X"ox'x" 1x" .A parse (derivation) tree for aabab Question 2 (10 Marks) [Any one of the two] Is this grammar ambiguous? Justify your answer Type? int l bool | ^Type I Type * Type I (Type) Or Ambigious Grammar CFG for the language L-ta'bekli, j, k 20 and i-or j-k} A ? AalE