In the lecture, we discussed a possible representations of truth values true and false in the lambda calculus, together with lambda calculus implementations of some logical operators. 1. Compute the value of ((or true) false) using beta -reductions. 2. Define the and operator in lambda calculus. Prove that your definition is correct, i.e., your lambda, term for and implements the logical and operation