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

a) (5pt) Define a function thres, which takes a lower bound a, an upper bound b and a list of numbers, and returns a new list consisting of numbers in the old list that are a and b. For example