Using Scheme in DrRacket please.

;Q5 boilerplate (implementations for reduce and filter) (define reduce (lambda (op base x) ;passing by name (if (null? x) base (op (car x) (reduce op base (cdr x))))))

(define filter (lambda (pred a-list) (if (null? a-list) '() (if (pred (car a-list)) (cons (car a-list) (filter pred (cdr a-list))) (filter pred (cdr a-list))))))

;Q5.1 ; enter your code here:

;Q5.2 ; enter your code here:

;Q5.3 ; enter your code here:

5. Implement the following operations which manipulate a binary number stored as a list of 0 s and 1s using some combination of the higher-order functions map, reduce, and filter. Do not use recursion. (Your solutions are likely to be compact once you have the logic.) 5.1 Create a procedure called (number-length lst) that counts how many digits are in the number. should give 6 . 5.2 Create a procedure called (count-zeros lst) that counts how many 0 s are in a number. Sample 5.3 Create a procedure called (binary->string lst) that converts a binary number in a list to a