Using C++, implement your efficient intersection algorithm in a routine called intersection. You may assume that the data elements in a Set class is stored in a template Vector. The private declaration of the Set class that is of relevance to this question is Vector data.

So, the elements of the set are stored in data. The intersection routine is a friend of the Set class. Implement the following:

template

void intersection(const Set &set1, const Set & set2,Set & set3);