2. Let L(a) be the language generated by G(a) (S, X} and (X,,S, P) where - {a, b), - (i) (3 marks) Describe the language L(a). (First generate a few strings using G(a).) (ii) (1 mark) Determine whether G(a) is a type 0 grammar but not a type 1 grammar, a type 1 grammar but not a type 2 grammar, a type 2 grammar bui not a typ3 grammar, or a type 3 grammar ii) (3 marks) Write a higher level (type 0 is the lowest level) grammar Ga) that also generates L(a) (iv) (1 mark) Is L(a) a regular language? Justify your