Question 6 (17 marks) 6a) It is known that the CFGS 0S1S1S0S | is ambiguous. Give an example with explanation to show this fact. (5 marks) 6b) Find the Chomsky Normal Form (CNF) for the following CFG: S AbA A Aa & (5 marks) 6c) Consider the language of all strings which contain two consecutive 0: A = {00,000,001,100,0000,0001, 0010, 0011, 0100, 1000, 1001, 1100, ...}. Give a RE corresponding to this language. (3 marks) 6d) Convert the following NFA to a DFA: 0,1 0, Y N 0 1 1 (4 marks)