Haskell (a) Define a function altMap, which takes as parameter a list of functions (instead of the one function for map) to apply toa list. altMap applies the functions in the functions list to the elements of the list in order. In other words, it applies the first function to the first element, the second function to the second, and so on, until it is time to go back to applying the first function to the next element. For example, altMap I(+10), (+1oo)] [o, 1, 2, 3, 4] evaluates to [1o, 101, 12, 103, 14] b) Using altMap, define the function luhn [Int]->Bool for the Luhn algorithm Haskell (a) Define a function altMap, which takes as parameter a list of functions (instead of the one function for map) to apply toa list. altMap applies the functions in the functions list to the elements of the list in order. In other words, it applies the first function to the first element, the second function to the second, and so on, until it is time to go back to applying the first function to the next element. For example, altMap I(+10), (+1oo)] [o, 1, 2, 3, 4] evaluates to [1o, 101, 12, 103, 14] b) Using altMap, define the function luhn [Int]->Bool for the Luhn algorithm