I need help with question #1 Rewrite Grammar G. Thank you!

Note: in all of the below capital letters are non-terminals, non-grammar symbols are terminals. 0. Given the following grammar, G: S AS#SA@A ACCA Cabc For each production below, state whether it is: In the language G decides - if so, prove it with a derviation and parse tree - if not, explain why If it is ambiguous in G - if so, prove it is with another valid parse tree in G Productions: I. a #b#c II. a @ #c III. a @b@c - 1. Rewrite grammar G so that: - no string in it is ambiguous - # has higher precedence than @ # and @ are both left-associative (i.e. a #b# c should mean (a #b) #c)