-Could you please answer this question by using haskell programming language and do a test for each function .?

1-Suppose you need a Haskell function sumSqNeg that takes a list of integers (type Integer) and returns the sum of the squares of the negative values in the list. Define the following Haskell functions. Use the higher order library functions such as map, filter, foldr, and foldl as appropriate.

a)Function sumSqNeg1 that is backward recursive. (Use recursion directly. Do not use the list-folding Prelude functions such as foldr or sum.)

b)Function sumSqNeg2 that is tail recursive. (Use recursion directly. Do not use the list-folding Prelude functions such as foldr or sum.)

c)Function sumSqNeg3 that uses standard prelude functions such as map, filter, foldr, and foldl.

d)Function sumSqNeg4 that uses list comprehensions .