hardD ×2.1 VERIFIED SOLVABLE

Goal The input is a list of words separated by whitespace. Sort the words into ascending alphabetical order, comparing them case-insensitively (so "Banana" and "banana" rank by the same letters). Output format Output the sorted words in lowercase, separated by single spaces, on one line. Nothing else — no quotes, no punctuation, no count. Example: input Banana apple Cherry → output apple banana cherry