1. For this question, we assume two lambda terms: W=xy.xyy and I=z.z. (d) This question is about the following Haskell function: f(x,y)=ifx=0thenyelse1+f(x1,y) i. Explain what this function does, by stating the output in terms of x and y. ii. Convert f so that it is a tail recursive function. iii. Write f as the fixpoint of a functional. Include all types in your