Hello, I need to use lambda calculus as a programming language to answer this question. Any help here would be appreciated.

Question: Define terms head and empty such that head [N,...] N empty [] true empty [N,...] false

(where means reduction by any number of -steps). The term head [ ] is an error in most programming languages; in this lambda-calculus version, it may reduce to whatever you like.