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_be_sorted_by_right_shift(arr):
      if len(arr) == 0:
          return True
      sorted_arr = sorted(arr)
      for i in range(len(arr)):
          if arr == sorted_arr[i:] + sorted_arr[:i]:
              return True
      return False
  
  assert can_be_sorted_by_right_shift([3, 4, 5, 1, 2])==True
  assert can_be_sorted_by_right_shift([3, 5, 10, 1, 2])==True
  assert can_be_sorted_by_right_shift([4, 3, 1, 2])==False
  assert can_be_sorted_by_right_shift([3, 5, 4, 1, 2])==False
  assert can_be_sorted_by_right_shift([])==True
output: def can_be_sorted_by_right_shift(arr):
      if len(arr) == 0:
          return True
      sorted_arr = sorted(arr)
      for i in range(len(arr)):
          if arr == sorted_arr[i:] + sorted_arr[:i]:
              return True
      return False