SOLVE IN RACKET

1. divisible-by-7? Define your own Racket function that takes a single integer as an argument and returns a Boolearn that indicates whether the number is evenly divisible by 7. You do not have to perform error checking on the input. Input: An integer Output: A Boolean. Example > (divisible-by-7? 14) #t > (divisible-by-7? 31) #f > (divisible-by-7? 56) 2. function-3 Define a function that takes a function as an argument and passes the number 3 to that function. The function argument must be able to accept a single integer as its argument. Input: A named function which takes a single number as an argument. Output: The value returned by applying the named function to the number 3. Example > (function-3 sqrt) 1.7320508075688772 > (function-3 (lambda (x) (+x 7))) 10 > (function-3 add1)