Can you help me understand this problem?

Now write a function $`$take$/3`$ that returns the first $n$ elements in a list. The first argument is the input list, the second is $n$$,$ and the third is the result.

This one is tricky. There are $*$two$*$ base cases to the recursion.

$*$Hint$*$: you may need to use the cut, depending how you structure this.

Do I recursively process it$?$ How do I complete this practice problem?