Given the following grammar: :: = if then | if then else | other :: = true | false Where other is a terminal that stands for any other kinds of statements. This grammar is ambiguous. Give a string having two different parse trees and draw the parse trees. If we adopt the disambiguating rule (used in most languages) "match each else with the closest previous unmatched then, " write an equivalent, unambiguous grammar