Construct a recursive definition for each of the following functions that involve lists. Use the infix form of cons in the recursive part of the definition. In other words , write h :: t in place of cons (h,t). f(z) = if z greater than or equal to 0 then < z, z - 1, ......., 0 > else < z, z + 1, ....... , 0>, over integers.

Want an answer?

No answer yet. Submit this
question to the community.