Show that term cons works by showing all beta reductions

Question

I\'m new to functional programming.

So the terms cons appends an element to the front of the list. Where cons ≜ λx:λl:λc:λn: c x (l c n).

How should I go about