Write a program that transforms each argument so that the last alphabetic character of every word is uppercase and every other letter is lowercase.

• Accept one or more string arguments and process each one independently.
• A word is a sequence of characters bounded by spaces, tabs, or the start/end of the string.
• For each word, find the last character in [a-zA-Z]: write it uppercase and write all other letters in that word lowercase.
• Non-alphabetic characters (digits, punctuation) are printed unchanged.
• A single-letter word must be uppercase.
• Print each transformed argument followed by a newline.
• If no arguments are provided (argc is 1), print wrong number of arguments followed by a newline.

Write a program that transforms each argument so that the last alphabetic character of every word is uppercase and every other letter is lowercase.

• Accept one or more string arguments and process each one independently.
• A word is a sequence of characters bounded by spaces, tabs, or the start/end of the string.
• For each word, find the last character in [a-zA-Z]: write it uppercase and write all other letters in that word lowercase.
• Non-alphabetic characters (digits, punctuation) are printed unchanged.
• A single-letter word must be uppercase.
• Print each transformed argument followed by a newline.
• If no arguments are provided (argc is 1), print wrong number of arguments followed by a newline.