Using Haskell

1. Use list comprehensions to define function trimAlpha :: String -> String that receives a string and eliminates every alphabetic (uppercase and lowercase) characters from that string. For example, if the input is "Ks%bU#n9x" then the output must be"%#9".

2. Define function fibList :: Int -> [Int]that receives a (positive) number n and returns the list of first n Fibonacci numbers. For example,fibList 10 must return the list[1,1,2,3,5,8,13,21,34,55].