Use $\beta$ reductions to compute the final answer for the following $\lambda$ terms. Use a "fake" reduction step for "+" operator. Identify each redex for $\beta$-reduction steps. Does the order in which you apply these $\beta$-reduction steps make a difference in the final answer?
(($\lambda$x.(($\lambda$z.(($\lambda$x.(z x)) 3)) ($\lambda$y.(+ x y)))) 1)
(($\lambda$z. (($\lambda$y.z) (($\lambda$x.(x x))($\lambda$x.(x x))))) 5)
My solution for #1 was as follows:
(($\lambda$z.(($\lambda$x.(z x)) 3)) ($\lambda$y.(+ 1 y)))
(($\lambda$x.(($\lambda$y.(+ 1 y))x))3)
(($\lambda$x.(($\lambda$y.(+ 1 y)) x)) 3)
(($\lambda$y.(+ 1 y)) 3)
(+ 1 3)
4
However I couldn't get anything for #2, could someone please show me the process.
Also my interpretation is that the order does affect the answer, but I have no reasoning for it.