Cush3252 Cush3252 28-11-2022 Engineering contestada Consider the regular grammar G given below: S → aA|bbS|bC A → aaA|aB B → bbB|λ C → aaC|a (a) Give a regular expression that describes the language L(G). (b) Convert G to an NFA using the procedure described in class.