Code on Dr Racket please

In a manner similar to the development of at-least?, write a function that consumes a value a natural number n, and a list lst, and determines whether the number of occurrences of in is not more than n. A lightly modified template is provided as a starting point. 0/1 points Attempts: 16 / Unlimited ;; at-most?: Any Nat (listof Any) -> Bool (define (at-most? val n lst) (cond [(and (empty? lst) (zero? n)) ...] [(empty? lst) ...] [(zero? n) ...] [else ...]))