Maximum Repeated Letter

You are given a string $S$ of length $N$. You need to find the maximum occurring character in $S$, i.e. the character with the maximum frequency. If different characters have the same maximum frequency, then print the lowest one among them, i.e. the one which comes first in the English alphabet. ###Input - The first line of the input contains a single integer $T$ denoting the number of test cases