Question 1. [3 MARKS] We can encode boolean logic in lambda calculus as follows: True = 1x.(Ay.x) False = 1x. (Ay.y) AND= Ap.(Aq.(pq)p) OR = Ap.(aq.(pp)9) Reduce the following lambda-expression to its b-normal form or show it to be diver- gent. Show your work in a similar way to the lecture slides. (AND True) False