In this task, you are given a string with duplicate characters ocurring in the string. You need to return the character which is ocurring with the maximum frequency. In case of a tie, return the character with the least ascii value.

Let me give you an example: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
The answer to this example can be: d
Here is why: d is ocurring with maximum frequency of 5.

OK. solve this:
wlraqenhzyueysnvhnyhktlgpsuerjfzkpomzzry
Answer:
y