Using Haskell

1. Define your own version of function take, called tke :: Int -> [a] -> [a]. Be careful about the edge cases, e.g., if the list is empty, input number is not positive, etc. Pattern match on the input list and avoid using take.

2. Define your own version of function elem, called elm :: (Eq a) => a -> [a] ->Bool. Pattern match on the input list and avoid using elem.