= - QUESTION 9 9 a) The grammar G is described by its vocabulary V = {a, b, c, A}, Production P = {A ab, A - abc, A - abcA), and Terminal symbols T = {a, b, c}. What language L (G) is generated by G? (6 marks) b) Draw a transition diagram of a finite-state automaton that accepts any strings over {1, 0}, which begins with odd number of 1 and ends with even number of 0. An example of an accepted string is 11100. (6 marks)