Consider the following Haskell datatype definitions for representing simple lambda calculus terms. data Term = Var String | Application Term Term | Lambda String Term

Write the following functions

a)substitute :: Term -> String -> Term -> Term, (substitute e x f) yields e except with f replacing all free occurrences of x in e

b)alphaRename :: Term -> String -> Term, performs an alpha renaming. (alphaRename t x) substitutes x for the formal parameter of t, which must be a lambda expression. You can assume that x is not free in t, i.e., not free in the body of t

please help me address these questions in haskell programming language