USE SCHEME/ DR RACKET!!!!!

You will be using procedural representation to implement sets of numbers. The range of the set is fixed by the bound variable defined in the answer-sheet file. Each set is a one-argument procedure/function that takes a number as an argument and tells whether the number is in the set (that is, returns \#t or \#f). You will be implementing the singleton-set, union, intersection, diff, filter, exists?, all?, and map-set functions. The behavior of these functions has been specified in the answer-sheet file. Examples: Note: Please ensure that you are using procedural representation as we discussed in class, using lists to store numbers of the sets will not get you any points You will be using procedural representation to implement sets of numbers. The range of the set is fixed by the bound variable defined in the answer-sheet file. Each set is a one-argument procedure/function that takes a number as an argument and tells whether the number is in the set (that is, returns \#t or \#f). You will be implementing the singleton-set, union, intersection, diff, filter, exists?, all?, and map-set functions. The behavior of these functions has been specified in the answer-sheet file. Examples: Note: Please ensure that you are using procedural representation as we discussed in class, using lists to store numbers of the sets will not get you any points