Done in C++.

Make an array based, templated Set class. Your class must do its own memory management, you may NOT use std::vector or any other library code to handle storage for your class. Copy constructor standard unknown.

Set A Set is a collection that can hold an arbitrary number of items. It however will only hold one copy of a given item (if you add 1 to the set (1, 2, 3} you still have {1, 2, 3}). Create a set that can be used like this: Set int> mySet; mySet.add(13); mySet.add(12); mySet.add(13); cout & other) const -member operator =-. Returns true if the two sets contain exactly the same items. The items do not have to be in the same positions. {1, 2, 3} is == to {3, 2, 1} string toString() const -returns a string that looks like {1, 2, 3} containing the items in the set. An empty set should return t}. Note that you can instead provide an overloaded stream insertion operator. Comment out the test of the one you do not provide. Set intersection With(const Set& other) const - returns a new Set containing the items that are in both this set and the other set. Set A Set is a collection that can hold an arbitrary number of items. It however will only hold one copy of a given item (if you add 1 to the set (1, 2, 3} you still have {1, 2, 3}). Create a set that can be used like this: Set int> mySet; mySet.add(13); mySet.add(12); mySet.add(13); cout & other) const -member operator =-. Returns true if the two sets contain exactly the same items. The items do not have to be in the same positions. {1, 2, 3} is == to {3, 2, 1} string toString() const -returns a string that looks like {1, 2, 3} containing the items in the set. An empty set should return t}. Note that you can instead provide an overloaded stream insertion operator. Comment out the test of the one you do not provide. Set intersection With(const Set& other) const - returns a new Set containing the items that are in both this set and the other set