For each of the following grammars state whether it is ambiguous or unambiguous. If it is ambiguous, give an equivalent unambiguous grammar and state all the precedence and the associativity enforced by the unambiguous grammar. If it is unambiguous, state all the precedence and the associativity enforced by the unambiguous grammar. a. E :: = E + F | F
F ::= F* F | Id |(E)

b. E :: = F â© E | F U E | F
F :: = F^ G| F v G |G
G:: = Id | (E)