input: Write a python function to find the union and intersection of two sets.
  assert union({1, 2, 3}, {3, 4, 5}) == [1, 2, 4, 5]
  assert union({6, 7, 8}, {8, 9, 10}) == [6, 7, 9, 10]
  assert union({1, 2}, {1, 2, 3}) == [3]
  
  assert intersect({1, 2, 3}, {3, 4, 5}) == [3]
  assert intersect({6, 7, 8}, {8, 9, 10}) == [8]
  assert intersect({1, 2}, {1, 2, 3}) == [1, 2]
output: def union(set1, set2):
      return sorted(list((set1 | set2) - (set1 & set2)))
  
  def intersect(set1, set2):
      return sorted(list(set1 & set2))