Compressed String

Problem Statement

Compressed String Problem Description Various compression methods are employed to minimize the size of messages transmitted over the internet. A specific algorithm compresses a given string by indicating the total number of consecutive occurrences of each character. For instance, consider the string 'abaaaasss'. The consecutive occurrences of each character are grouped as follows: 'a' occurs one time. 'b' occurs one time. 'a' occurs two times consecutively. 'a' occurs one time. 's' occurs one time. 's' occurs two times consecutively. If a character occurs only once, it is added to the compressed string. If it occurs consecutively, the character is added to the string followed by an integer representing the number of consecutive occurrences. Thus, the compressed form of the string is 'aba2sas2'. Function Description Complete the function compressedString in the editor below. The function must return the compressed form of message. The function has the following parameter(s): string mess