consider Haskell program, prove following.

7. In this question you may assume that the lists are finite and the functions all terminate. Consider the following functions: (.)::(b + c)+(a+b) + (a + c) 9.f =r+g(fa) map :: (a + b) + ([a] + [b]) map f l = 0 map f (x:xs) = (f a) : (map f xs) Prove that map (f.g) xs = map f (map g xs) where xs is any list