Write a tall-recursive Racket function that finds the minimum number in a list. I have started your work by writing a convenience function "min-value" that initializes your function's accumulator to the first element of the list. Your function should maintain the invariant that the smallest element in the original list is either the accumulator or the smallest element that remains in the list being processed. For example, my (min-value (4 3 2 1]) calls your (min-helper 4 (3 2 1]] which should evaluate to l; and my (min-value [1 2 3 4]) calls your (min-helper 1 (2 3 4]] which should also evaluate to 1. Save v Grading 1 1 Full Screen RI code.rkt New 1 #lang racket 2 (provide min-helper) ; do not change any code above this line. Write your code below it. ; returns smallest element between acc and xs (define (min-helper acc xs) Test Case 1 Not run NC Slovo 9 (define (min-value xs) 10 (min-helper (first xs) (rest xs))) 11 Write a tall-recursive Racket function that finds the minimum number in a list. I have started your work by writing a convenience function "min-value" that initializes your function's accumulator to the first element of the list. Your function should maintain the invariant that the smallest element in the original list is either the accumulator or the smallest element that remains in the list being processed. For example, my (min-value (4 3 2 1]) calls your (min-helper 4 (3 2 1]] which should evaluate to l; and my (min-value [1 2 3 4]) calls your (min-helper 1 (2 3 4]] which should also evaluate to 1. Save v Grading 1 1 Full Screen RI code.rkt New 1 #lang racket 2 (provide min-helper) ; do not change any code above this line. Write your code below it. ; returns smallest element between acc and xs (define (min-helper acc xs) Test Case 1 Not run NC Slovo 9 (define (min-value xs) 10 (min-helper (first xs) (rest xs))) 11