(Solved): Using mathematical induction, prove that the Haskell expression: foldr (+) 0 x always gives the sum ...

Using mathematical induction, prove that the Haskell expression: foldr (+) 0 x always gives the sum of the elements of the list x.

a) What is the “Base Case”?

b) Is the “Base Case” true?

c) What is the “Induction Hypothesis”?

d) What is the “Induction Step”?

e) Show that from “Induction Hypothesis” you can derive the “Induction Step”