Help for racket

Write a structurally recursive function (drop n los) that takes two arguments: a non-negative integer n and a list of symbols los.

  ::= 0 |  + 1 

drop returns a list containing all of the items in los except the first n. For example:

 > (drop 2 '(a b c d e)) '(c d e) 

You may assume that los contains at least n items, that is, you will run out of n before you run out of symbols. For one extra credit point, write drop so that it gracefully handles cases in which n is greater than the length of los.