Dr. Racket

I am trying to create a recursive function that will will print out a list up to nth element

For example ( first-n 1 ((a) b c d) ) should return '((a)) (define first-n (lambda (n list) (cond [(> n (length list)) "Error: Index out of Range"] [(= n 1) (car list) ] // Print car then recursively call the rest of the list [else (cons (car list) '()) (first-n (- 1 n) (cdr list))]

) ) )