PLEASE SOLVE WITH HASKELL

Next you will write functions to multiply two big integers. First write a function mulByInt :: Int BigInt BigInt which takes an integer and a big integer, and returns the big integer list which is the result of multiplying the big integer with the integer. You should get the following behavior: ghci> mulByInt 9[9,9,9,9] [8,9,9,9,1] Now, using mulByInt, fill in the implementation of bigMul::BigIntBigIntBigInt Again, you have to fill in implementations for f, , only. Once you are done, you should get the following behavior at the prompt: ghci>bigMul[9,9,9,9][9,9,9,9][9,9,9,8,0,0,0,1]ghci>bigMul[9,9,9,9,9][9,9,9,9,9][9,9,9,9,8,0,0,0,0,1]