IMPORTANT! Use Haskell

Write a function that maps a list of Strings that may have multiple words to Strings with only the first word left. E.g. ["Today is Thursday", "Banquet", "unreal games"] becomes ["Today", "Banquet", "unreal"].

Write a function that takes a two-dimensional matrix of Strings and transforms all empty strings to "0".

Sort a list of Strings by length of the first word in the strings (if the strings have more than one word)

Pack repeats in a list of Chars into separate lists, resulting in a sorted list of lists: E.g.,

['a', 'a', 'a', 'a', 'b', 'c', 'c', 'a', 'a', 'd', 'e', 'e', 'e', 'e'] becomes ["aaaaaa","b","cc","d","eeee"]