Please help with this question, good answers will get upvotes

Consider the following grammar: S aS|SbS|a|c (a) Give an example string that has two different parse trees (b) Give a leftmost derivation and a rightmost derivation for the string from 2(a). (c) Give two different parse trees for the string from 2(a). (d) Modify the grammar to remove ambiguity. (e) ( Explain how your new grammar modifies the parse tree you drew in 2(c) to remove ambi-guity.