Question 3 (Total = 25 marks) Consider the language L of all strings of symbols from the alphabet = {a,b,c} where each a is followed by b, and c only appears in pairs. For example, abce, babbcc and ccabccab are in the language, but abc, accb and ccba are not. a) Draw the finite state diagram of a deterministic finite automaton for L. (7 marks) (8 marks) b) Provide a regular expression corresponding to L. c) Provide a grammar (regular grammar or context-free grammar) corresponding to L and transform it into Chomsky Normal Form. (10 marks)