If A, B, and C are lambda expressions, then by associativity, ABC is a short form of A(BC) T or F

(y|yz)b is a shorter, but equivalent way of writing ((y|(yz))b) T or F

((x|s(sx))x) is equivalent to ((y|s(sy))y) T or F

(y|sy)x is in normal form T or F

These questions are about LISP

please explain the reason