input: Write a function that takes two sets of integers as input and returns the intersection of those sets. If the sets have no common elements, return an empty set. If either set is empty, return an empty set.
  
  assert intersection({1, 2, 3, 4}, {3, 4, 5, 6}) == {3, 4}
  assert intersection({1, 2, 3}, {4, 5, 6}) == set()
  assert intersection({1, 2}, set()) == set()
  assert intersection(set(), {3, 4, 5}) == set()
  assert intersection(set(), set()) == set()
output: def intersection(set1, set2):
      if not set1 or not set2:
          return set()
      return set1 & set2