Kata

Write a function that accepts two parameters, i) a string (containing a list of words) and ii) an integer (n). The function should alphabetize the list based on the nth letter of each word.

The letters should be compared case-insensitive. If both letters are the same, order them normally (lexicographically), again, case-insensitive.

Example:

function sortIt('bid, zag', 2) //=> 'zag, bid'

function sortIt('bid, zag', 2) //=> 'zag, bid'

sort_it('bid, zag', 2) #=> 'zag, bid'

sortIt ["bid", "zag"] 2 `shouldBe` ["zag", "bid"]

The length of all words provided in the list will be >= n. The format will be "x, x, x". In Haskell you'll get a list of Strings instead.