a. Consider the following Context Free Grammar (CFG) with nonterminals A and B, terminal symbols ' x ', ' y ' and ' z ' and production rules: AA B A z BxxBx | yy i. If A is the starting symbol, then the word "zxyz" can be derived from this context-free grammar. Give three other words which can also be derived. [5 marks] ii. Explain what is meant by the term "left-recursive context free grammar" and explain whether the CFG given above is left recursive. [5 marks] iii. Draw a parse tree for the following word which can be derived by the above CFG: zxxyyxz [5 marks] b. Consider the following NFA over alphabet {a,b} : i. Identify the start and final state(s) of the NFA. [2 marks] ii. Construct a DFA which is equivalent to the NFA by using the subset construction. Illustrate the steps taken