input: Write a function to determine if it is possible to sort a 3D vector represented by a tuple in non-decreasing order by performing any number of right shift operations on the components. If it is possible return True else return False. If the given vector is empty then return True.
  assert sort_3d_vector((3, 4, 5))==True
  assert sort_3d_vector((5, 3, 4))==True
  assert sort_3d_vector((4, 2, 3))==False
  assert sort_3d_vector((3, 5, 4))==True
  assert sort_3d_vector(())==True
output: def sort_3d_vector(vector):
      if not vector:
          return True
      for i in range(len(vector)):
          if sorted(vector) == vector[i:] + vector[:i]:
              return True
      return False