Just need help on parts b and c.

2. Consider the following grammar SaSA C Able (a) pts) Prove that the grammar is ambiguous by drawing two different densvation trees for the string, aabb (b) (5 pts) Specify the language generated by the ambiguous grammar above. (c) pts) Construct an equivalent unambiguous grammar for the grammar above. Note: Two grammars are equivalent when they generate the same language