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.
  assert main("{'absorbed': [1, 2, 3, 4, 5], 'emitted': [5, 4, 3, 2, 1]}") == True
  assert main("{'absorbed': [1, 3, 2, 4, 5], 'emitted': [5, 4, 3, 2, 1]}") == False
  assert main("{'absorbed': [], 'emitted': []}") == True
output: def main(data):
      absorbed = data['absorbed']
      emitted = data['emitted']
      
      if not absorbed:
          return True
      
      n = len(absorbed)
      for i in range(n):
          if absorbed == emitted:
              return True
          absorbed = absorbed[-1:] + absorbed[:-1]
      
      return False