For the following BNF grammar rules, answer the questions that follow. ::=
::= ; | ;
::= =
::= a | b | c | d
::= |
::= | const
::= + | - | * | \ | %

Required:
a. Is this grammar ambiguous?
b. If this grammar is ambiguous, re-write the rules to remove the ambiguity such that:

a. You do not add any new grammar rules
b. You only change 1 nonterminal within 1 grammar rule.
c. Any previously valid sentence continues to be valid.

If the grammar is not ambiguous, re-write the rules as is from above with no changes.