d) Answer the following questions about CFGs. i. Give a CFG that generates the language defined by the regular expression ((aba)(b(aa)b))+over the alphabet {a,b}. [5 marks] ii. Consider the following CFG over the alphabet {a,b}, where S is the initial production: - STaT - TaTaTbTbTaT In a sentence, what language does it generate? Justify your answer. [5 marks]