Need Haskell code for the following program that uses tail recursion.

public static int factorial1(int n, int fac) { if ( n <= 1 ) return fac; else return factorial1( n - 1, fac * n); }

public static int fact(int n) { return factorial1(n , 1); }