For this task, you are to implement a simple compression algorithm.

The logic for this particular simple compression algorithm is shown in the flowchart below:

Start

Get input text from the user

Let 'compressed' be an empty string

and start the count at $1$

Let 'prev$\_$char' be the first character

from the input text

Update 'prev$\_$char' to "char'

Add the count and 'prev$\_$char' to the

end of 'compressed'

Display 'compressed'

The purpose of the algorithm is to represent text in a way that is more efficient for many repeated characters. See the examples for how this is expected to work.

Examples for testing

Use the examples below, as well as your own examples, to test your code. The output from your code should exactly match what is shown here.

Example run $1$

Text to compress: aaaabba

$4$a$2$b$1$a

Example run $2$

Text to compress: freeeeeeeee

$1$f$1$r$9$e

Example run $3$

Text to compress: python

$1$p$1$y$1$t$1$h$1$o$1$n