Add member functions setUnion$(),$ setIntersection$(),$ and setDifference$().$

The functions should all return the resulting LinkedSet object. We won't need to throw a CapacityExceeded exception in the setUnion$()$ function, because the Set will have unlimited capacity. You'll still need the DuplicateItemError exception in your insert$()$ function.

You may use contains$()$ and the Node class accessors and mutators, but, other than those, do not use any explicit function calls in your definitions of these three functions! The operations must be coded without explicitly calling any other functions to help. The practice manipulating the pointers directly will be extremely valuable.

$($#ifndef LINKED$\_$SET$\_$H

#define LINKED$\_$SET$\_$H

#include "SetInterface.h$"$

#include "Node.h$"$

namespace cs$\_$set $\{$

template

class LinkedSet : public SetInterface

$\{$

public:

LinkedSet$()$;

LinkedSet$($const LinkedSet& aSet$)$;

virtual ~LinkedSet$()$;

int size$()$ const override;

bool empty$()$ const override;

void insert$($const ItemType& newEntry$)$ override;

void erase$($const ItemType& anEntry$)$ override;

void clear$()$ override;

bool contains$($const ItemType& anEntry$)$ const override;

int count$($const ItemType& anEntry$)$ const override;

std::vector toVector$()$ const;

LinkedSet setUnion$($const LinkedSet& set$2)$ const;

LinkedSet setIntersection$($const LinkedSet& set$2)$ const;

LinkedSet setDifference$($const LinkedSet& set$2)$ const;

private:

int itemCount;

Node$*$ headPtr;

Node$*$ getPointerTo$($const ItemType& target$)$ const;

$\}$;

$\}$

#endif

$)$