Consider the following grammar for logical expressions, rightarrow || | rightarrow && | rightarrow () | rightarrow > | rightarrow + | - | rightarrow / | * | rightarrow () | rightarrow A|B|C|D (1) Show a parse tree for logical expression A > B || B > C && A > D. (2) If A = 40, B = 30, C = 25, D = 55, what is the result of the logical expression, true or false? Explain how you obtain the result