Write a program that takes a string and prints it with each alphabetical character repeated according to its 0-based position in the alphabet, followed by a newline.

• a is at position 0 and is printed 0 times (it disappears), b is at position 1 and is printed once, c twice, and so on up to z which is printed 25 times.
• Case is preserved: A disappears, B prints once, Z prints 25 times.
• Non-alphabetical characters are always printed exactly once.
• If the program does not receive exactly one argument (argc must be 2), print wrong number of arguments followed by a newline.

Write a program that takes a string and prints it with each alphabetical character repeated according to its 0-based position in the alphabet, followed by a newline.

• a is at position 0 and is printed 0 times (it disappears), b is at position 1 and is printed once, c twice, and so on up to z which is printed 25 times.
• Case is preserved: A disappears, B prints once, Z prints 25 times.
• Non-alphabetical characters are always printed exactly once.
• If the program does not receive exactly one argument (argc must be 2), print wrong number of arguments followed by a newline.