Your submitted file must be interpretable by GHCi interpreter in Haskell

(a) 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.

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

(c) Define your own version of function Data.List.intersperse, called intrsprse :: a -> [a] -> [a]. This function takes an element and a list and then puts that element in between each pair of elements in the list (if there are at least two elements in the list). For example, intrsprse 0 [1..5] must return [1,0,2,0,3,0,4,0,5]. Pattern match on the input list.