Write a Haskell program for the following:

A logical formula in two variable is a function of the form f :: (Bool, Bool)- > Bool. Write a function twoTautology:: ((Bool, Bool) -> Bool) -> Bool which determines whether a logical formula f is always true (i.e. a tautology): to be a tautology it must be true for all possible arguments of f)! Now write a function which determines whether two logical functions of two variables are equivalent: twoEquiv::((Bool, Bool)->Bool)-> ((Bool, Bool)->Bool)->Bool This should be true when the functions agree on all inputs