I need help with this

Using the following grammar, show a 3 different parse trees for the string a b a a. G rightarrow S $$ S rightarrow A M M rightarrow S | epsilon A rightarrow a E | b A A E rightarrow a B | b A | epsilon B rightarrow b E | a B B