1. For this question, we assume two lambda terms: W=xy.xyy and I=z.z. (c) Consider the following two Haskell function definitions: encode n= False fx=f(x+1) i. Explain how Haskell evaluates the expression: encode ( (f0) ii. Now consider the variant: encode 0= True encode n= False fx=f(x+1)