Remember the `take` function of Haskell? It can be defined in Haskell

as:

take :: Int -> [a] -> [a]

take 0 _ = []

take _ [] = []

take n (x:xs) = x : take (n-1) xs

Formulate the appropriate Prolog predicate `take(N,Xs,Ys)` which is

true if (and only if) `Ys` is what results from taking `N` elements

from `Xs`. That is, `take(3,[1,2,3,4,5],[1,2,3]).` would evaluate to

`true`, or `take(3,[1,2,3,4,5],Ys).` would give `Ys = [1,2,3]`