input: Write a function to determine if it is possible to get a string in which all the characters are alphabetically sorted by performing any number of cyclic shifts on the given string. If it is possible return True else return False. If the given string is empty then return True.
  assert can_alphabetically_sorted('dacb')==True
  assert can_alphabetically_sorted('bca')==True
  assert can_alphabetically_sorted('defg')==True
  assert can_alphabetically_sorted('bdeff')==False
  assert can_alphabetically_sorted('ab')==True
  assert can_alphabetically_sorted('')==True
output: def can_alphabetically_sorted(s):
      if not s:
          return True
      doubled_s = s + s
      for i in range(len(s)):
          if doubled_s[i:i+len(s)] == ''.join(sorted(s)):
              return True
      return False