Implement the following functions in Scheme using foldl, filter and map. DO NOT use recursive definition for this problem.

(5pt) Define a function trunc, which takes a lower bound a, an upper bound b and a list of numbers, and replaces all numbers that are b by b. For example, (trunc 01(21012) ) ; returns ' (00011) (trunc 0.51.5(21012) ) ; returns' (0.50.50.511.5) (trunc 111(21012)); returns '( (11111)