input: Write a Python function to check if you can transform a given array into a non-decreasing order by performing any number of right shift operations. Return True if possible, otherwise return False. For an empty array, 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(1, n):
          if arr[i] < arr[i - 1]:
              count += 1
              if count > 1:
                  return False
      if count == 0:
          return True
      return arr[0] >= arr[-1]