Use Racket (preferred) or python

Write a structurally recursive function (take n lst) that takes two arguments: a non-negative integer n and a list lst. take returns a list containing the first n items in lst. For example:

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

You may assume that lst has at least n items. Write a second function, take-two, that gracefully handles cases in which n is greater than the length of lst.