Answer the following questions based on the lambda-calculus term (λx. λy. y x) (λ. y). (a) Calculate its free variables using the FV function we discussed in class. Show the steps. Note that "y x" stands for a function application calling y with argument x. y (b) Use lambda calculus reduction to reduce the term to its normal form. Begin by renaming bound variables and show every step. (c) Describe what would go wrong if you did not rename bound variables.