Consider the following CFGG=({S,A,B},{0,1},R,S) where R is given below R:S0S/1A;A1B/1S/e;B0B/0S/e (a) Is the language LG a regular language ? If so compute an NFA that accepts it ; if not explain why not. (Hint : Note that G is a right linear CFG ) (b) Sketch a parse tree for the string 00110LG. Based on your parsing diagram discuss whether G is an ambiguous or a non-ambiguous grammar