1. Consider the following lambda expression (\lambda~x.~(\lambda~y.y+x) ((\lambda~z.z+x)x) 3) ( x . ( y . y + x ) ( ( z . z + x ) x ) 3 ) What is the normal form after all right-most reductions have been performed?

2. Define the concept of closures.

3. In the C programming language, users can pass as arguments and return pointers to functions. Does this make the C language support higher-order functions?

a. True

b. False