I need help with this problem,

Let:

a) Give CFGs for L and L2 b) Is LnL2 a CFL? Justify your answer. c) Using the CFG designed for L as a template, design another CFG for the language (denoted as Lpref) of all strings that are prefixes of the strings in Li.e Lpre,-{x | x is a prefix of a string in Li} nition, each string in Li will generate multiple strings in Lpref. For example, the string abb? which is in L1 will generate the following list of strings in re: e, a, ab, abb, abbe, abbce a) Give CFGs for L and L2 b) Is LnL2 a CFL? Justify your answer. c) Using the CFG designed for L as a template, design another CFG for the language (denoted as Lpref) of all strings that are prefixes of the strings in Li.e Lpre,-{x | x is a prefix of a string in Li} nition, each string in Li will generate multiple strings in Lpref. For example, the string abb? which is in L1 will generate the following list of strings in re: e, a, ab, abb, abbe, abbce