Use java language

This program is a program for converting the format of a string from one form to another, according to the following criteria:

The program will read the text from the input string, assuming a name S with a size of n characters, where $1<=$n$<=4096($meaning S must consist of at least $1$ character and not exceed $4096$ characters$).$

Student $""$ should write a program to change input string S to output string O$.$ When entering the input string S$,""$ must always enter the character $\text{'}$$$\text{'}$ at the end of the string.

When the program changes the value of string S to string O$,$ the program will not print the character $\text{'}$$$\text{'}$ in the output string O$.$

Student $""$ should write a program to count the number of consecutive and duplicate English alphabet characters in the input string S and print the value of $(1)$ the number of individual English alphabet characters $(2)$ the number of consecutive and duplicate characters $($referred to as variable k$)$ in the output string O$.$

a$.$ In cases where the alphabet characters have only one occurrence and are not repeated consecutively, the program will set the value of k$=1.$

b$.$ Uppercase and lowercase English alphabet characters $($e$.$g$.,\text{'}$A$\text{'}$ and $\text{'}$a$\text{'})$ are considered different characters.

Example:

If student $""$ inputs a string of $12$ characters followed by $:

aaaBBcdefFF$

The program will produce the output string as:

a$4$B$2$c$1$d$1$e$1$f$1$F$2$

Because the input string has $4$ consecutive $\text{'}$a$\text{'}$ characters $($k$=4),2$ consecutive $\text{'}$B$\text{'}$ characters $($k$=2),\text{'}$c$\text{'},\text{'}$d$\text{'},\text{'}$e$\text{'},$ and $\text{'}$f$\text{'}$ characters are not repeated consecutively $($k$=1),$ and $\text{'}$F$\text{'}$ has $2$ consecutive characters $($k$=2).$

Input:

The input consists of $1$ line:

Line $1$ contains a string of n characters $(1<=$n$<=4096)$ followed by $\text{'}$$$\text{'}.$

Note: In this program, we assume that the input data is always correct, so students do not need to verify the correctness of the input data. This means:

$(1)$ No need to check if $1<=$n$<=4096.$

Line $1$ contain a String

input :

s$

output :

s$1$

input :

aaaaaaaaaaaaaaaaBBBBBBccEFG$

output :

a$16$B$6$c$2$E$1$F$1$G$1$

input :

kkkkkkpppppQQQQkkkppQ$

output :

k$6$p$5$Q$4$k$3$p$2$Q$1$s