In Scheme, Create a simple function divisible-by? which takes two numbers and returns #t or #f if the first parameter is divisible by the second parameter. Note: if the first parameter and second parameter are the same number, it should consider this a #f case.

For example:

(divisible-by? 10 2) #t

(divisible-by? 10 3) #f

(divisible-by? 2 2) #f

Then

Remember: Currying is when we use a function to build a function that we can use. Create a Curry Function called not-divisible-by. not-divisible-by should take a number as a parameter and use that to create and return a function that takes a parameter that uses divisible-by? This should create the ability to pass in the number you want to check if another number is not divisible by:

Example

((not-divisible-by 2) 10) #f

((not-divisible-by 3) 10) #t

(not-divisible-by 4) #

Note: Example of currying:

(define add-two (lambda (a b) (+ a b)))

(define add-this-to (lambda (val)

(lambda (num) (add-two val num))))

((add-this-to 5) 6) 11