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.
One example is below.
Q: mvwduljootadondrwbrledodqnmfqtxalvuxnfgft
A: d
Rationale: d is ocurring with maximum frequency of 5.
Q: rigabchdgzulwxgylasliyzxykvyyzkwkvfazelhhdd
A:
y