input: Write a function to determine if a given string can be transformed into a palindrome by performing any number of character deletions from the string. If it is possible return True else return False. If the given string is empty then return True.
  assert can_become_palindrome("racecar")==True
  assert can_become_palindrome("abcde")==False
  assert can_become_palindrome("aabb")==True
  assert can_become_palindrome("aaabb")==True
  assert can_become_palindrome("")==True
output: def can_become_palindrome(s):
      from collections import Counter
      count = Counter(s)
      odd_count = sum(1 for v in count.values() if v % 2 != 0)
      return odd_count <= 1