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.

Example Input: buxusrcnirvzpgzlulyazqtnawtregxujvpsfsssjanlaiqjwo
Example Output: s

Example Input: mdtpsgqrobpbktbthwbbchevbcivcjfkcgnypvktmuqowxruro
Example Output: b

Example Input: nksugexplwaeontfvekhehmghmradwxhdepgkfcpqnejth
Example Output:
e

