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