Please help with my homework

Theory of Computation

Problem 1. Regarding to the following grammar: S AB A AA2 B + bB 2 1. Find the leftmost and the rightmost derivation of string abbb 2. Draw the derivation tree of string abbb 3. Use set notation to define L(G). Problem 2. Regarding to the following ambiguous grammar: S AabaA A a | bA 11 1. Find the 2 different leftmost derivations of string aabaa 2. Draw the 2 different derivation trees of string aabaa 3. Use set notation to define L(G)