1. Consider the grammar G below. For each string, determine whether the string is part of L(G) If it is in L(G), prove it by giving a parse tree. If the parse is ambiguous, prove that by giving two parse trees. If the string is not in L(G), explain why not (one sentence should be sufficient) Start symbol S 2. Rewrite G so that is not ambiguous 3. Write a regular expression for the language over alphabet a, b, c containing all strings with no more than two as Write a grammar for the same language. Indicate whether your grammar is ambiguous and briefly give your reasoning