Write a MIPS program that does the following steps:

$1.$ Declare a string and count the number of each character that appears

in the string.

$2.$ Print the characters and their number of appearance by ascending order

$($if the number of appearance is the same between some numbers, print

the one that has the smaller ASCII code first$).$

For example, if the input string is a$,$ b$,$ d$,$ e$,$ e$,$ f$,$ g$,$ g$,$ f$,$ f the output

should be a$,1$; b$,1$; d$,1$; e$,2$; g$,2$; f$,3.$