For each of the following grammars state whether it is ambiguous or unambiguous. if it is ambiguous give an equivalent unambiguous grammar. if it is unambiguous, state all the precedence and associativities enforced by the grammar. assume id generates identifiers. a) e: : = e + f | f f: : = f * f | id | (e) b) e: : = f e | f e | f f: : = f g | f g | g g: : = id | (e)