Given the following BNF grammar: rightarrow |a| b (a) Show the derivation of the string "abaab" by drawing the parse tree (b) Prove that the given grammar is ambiguous. (c) Construct an equivalent BNF grammar which is unambiguous. Consider the following BNF grammar of algebraic expressions with a single identifier a rightarrow + | - | * | / | a How many parse trees are there for each of the following: (a) a - a/a (b) a + a * a - a (c) ((a + a) + a) + a Explain your answer in each case. Try to explain without drawing all the parse trees