Answer: C
Set intersection can be done well by sorting both sets, O(n log n), then using the merge technique, O(n), to form the intersection.
If the sets are subsets of a finite and small set of possibilities, the intersection could be done by an and (&) operation on bit vector representations of the sets, which would be much faster.