[Note: Use "" for the lambda character in your answers] Problem 1 [10 Points]. Using the definitions of boolean constants and operators presented in class, show that the following evaluates to false. Show all your steps for a perfect mark. Always evaluate the "outer" applications first (i.e., use lazy evaluation), but continue to evaluate further until you obtain false or false (not true) Problem 2 [5 5 Points]. Define the higher-order library function curry that converts a function on triples into a curried function, and, conversely, the function uncurry that converts a curried function with three arguments into a function on triples [Note: Use "" for the lambda character in your answers] Problem 1 [10 Points]. Using the definitions of boolean constants and operators presented in class, show that the following evaluates to false. Show all your steps for a perfect mark. Always evaluate the "outer" applications first (i.e., use lazy evaluation), but continue to evaluate further until you obtain false or false (not true) Problem 2 [5 5 Points]. Define the higher-order library function curry that converts a function on triples into a curried function, and, conversely, the function uncurry that converts a curried function with three arguments into a function on triples