Hello. I need help with a C$++$ program that performs basic string compression for a sequence of characters using the counts of repeated characters. The string "aabcccccaaa" would become $"$a$2$b$1$c$5$a$3".$ If the compressed string is not smaller than the original string, your program should consider the original string as the final result. The program should handle both uppercase and lowercase letters but treat them as distinct characters $(\text{'}$A$\text{'}$ is different from $\text{'}$a$\text{'}).$