TRY TO YOUR BEST TO DO YOUR OWN:)
Code


# Code
```python []
class Solution(object):
    def makeSmallestPalindrome(self, s):
        s=list(s)
        n=len(s)
        for i in range(n/2):
            if s[i]!=s[n-1-i]:
                if ord(s[i])<ord(s[n-1-i]):
                    s[n-1-i]=s[i]
                else:
                    s[i]=s[n-1-i]
        return "".join(s)
        
```
['String', 'Python']