input: Write a function to determine if it is possible to get an array sorted in non-decreasing order by performing any number of right shift operations on the given array. If it is possible return True else return False. If the given array is empty then return True.
  def can_sort_by_shifting(arr):
      if not arr:
          return True
      n = len(arr)
      for i in range(n):
          if arr == sorted(arr):
              return True
          arr = arr[-1:] + arr[:-1]
      return False
  
  assert can_sort_by_shifting([3, 4, 5, 1, 2])==True
  assert can_sort_by_shifting([3, 5, 10, 1, 2])==True
  assert can_sort_by_shifting([4, 3, 1, 2])==False
  assert can_sort_by_shifting([3, 5, 4, 1, 2])==False
  assert can_sort_by_shifting([])==True
output: def can_sort_by_shifting(arr):
      if not arr:
          return True
      n = len(arr)
      for i in range(n):
          if arr == sorted(arr):
              return True
          arr = arr[-1:] + arr[:-1]
      return False