LISP lambda calculate expression

3) Consider reducing the following -expression to its normal form. Show the sequence of normal order reductions the sequence of applicative order reductions. 4) Consider the following function: Fx) ifx-0) then return 0 else return x+1 a) Express F as a lambda calculus expression b) Evaluate F(0) as a lambda expressiorn c) Evaluate F(1) as a lambda expression HINT: Use the representations introduces in Section 10. 5) Describe a function to compute the sum of the cubes of the first n positive numbers, using the abstract programming language introduced in section 11