Problem 1 - Scheme Programming 1. As we discussed in class, let and let* do not add anything to the ex- pressiveness of the language, i.e., they are only a convenient shorthand. For instance (let ((x vi) (y v2)) e) can be rewritten as ((lambda (x y) e) vi v2). How can you rewrite (let* ((x vi) (y v2) (z v3)) e) in terms of A-abstractions and function applications? 2. Use the map and reduce functions we learned in class to implement function minAbsoluteVal that determines the minimal absolute value of a list of integer numbers. Example (define minAbsoluteVal (lambda (1) minAbsoluteVal '(-5 -3 -7 -10 12 8 7))-> 3