Hello, I need to use lambda calculus as a programming language to answer this question. Any help is appreciated. Please find an image attached for the question, below the image I have written what I need to show.

Question:

Show that it works by reducing cons 3 [2, 1] to [3, 2, 1] . Make sure to include every -step, and try to use abbreviations for readability.

The term cons appends an element to the front of a list. cons 4 lx. Xl. c.In. C X c x (1 cn) The term cons appends an element to the front of a list. cons 4 lx. Xl. c.In. C X c x (1 cn)