(Solved) : Et L Language Generated G N 2 S P 2 B N S X S Axb X Ax Bx Epsilon 3 Marks Describe Languag Q31742849 . . . .

et L(a) be the language generated by G(a) – (N, 2, S, P) where 2- [a, b), N= {S,X) and S->aXb X->aX|bX|epsilon (i) (3 marks)Describe the language L(a). (First generate a few strings usingG(a)) i (1 mark) Determine whether G(a) is a type 0 grammar but nota type 1 grammar, a type 1 grammar but not a type 2 grammar, a type2 grammar but not a type 3 grammar, or a type 3 grammar ii) (3marks) Write a higher level (type 0 is the lowest level) grammarGa) that also generates L a) (iv) (1 ark) Is L(a) a regularlanguage? Justify