Take a concrete implementation in Racket and create a new function that generalizes the behavior.
Consider the problem of finding the average of a list of numbers, and then multiplying it by three.
(* (/ (reduce + (list 1 2 3 4)) (length (list 1 2 3 4))) 3)
Write a procedure, average-times-n, that generalizes this approach by taking a list and integer as parameters, and producing the average multiplied by the given integer.