If an expression has a normal form, then normal order reduction is a more efficient way to compute it than applicative order T or F

If AOR reduces a lambda expression to a normal form, then NOR will always find the same normal form T or F

Let AB be an arbitrary sequence of reductions from A to some expression B. If A has a normal form E, then there is always a reduction BE T or F

If NOR reduces a lambda expression to a normal form, then AOR will always find the same normal form T or F

These questions are about LISP

please explain reason