2 Derivation, Parse Tree, Ambiguity, Prece- dence & Associativity A language that is a subset of the language of propositional logic may be defined as follows: ::= :: = V | | + | :: = true false :: = a | b | c | ... | 2 (a) Give a leftmost and a rightmost derivation for the sentence a V false 1 b + false . (b) Give the corresponding parse trees for the derivations. (c) Show that the above grammar is ambiguous. (d) Give an unambiguous grammar for the same language that enforces the following precedence and associativity: has highest precedence (binds strongest), followed by V, and then A and V are left associative, and is right associative (e) Give the parse tree and AST for your new, unambiguous grammar for the sentence a V true Ab + false V true