Take a look at the grammar below and solve the following problems. A0A1AA1A0AC (a) Give a leftmost derivation for the string 100101. (3 points) (b) Sketch the parse tree corresponding to the derivation you gave in (a). (2 points) (c) Demonstrate that the given grammar is ambiguous by showing three more parse trees (apart from the one you already found in (b)) for the same string. ( 3 points) (d) Find a string w of length six such that w has exactly one parse tree in the grammar above. (1 point) (e) Desgin an unambiguous Context Free Grammar for the language represented by the given ambiguous grammar. (1 point)