consider a language where equality (the == operator) has higher precedence than and (we use the and keyword). It must also not be ambiguous. The terminals are: T = { true, false, ==, and} Write out the BNF. next, draw a parse tree and derivation for true and false == false and true