Need to add two class to this C++ program.

Bag Bag::Union(Bag X), is to find union of items of the bag and another bag, X. The return type is also an instance of Bag class. Bag Bag::Intersect(Bag X), is to find intersection of items of the bag and another bag, X. The return type is also an instance of Bag class.

And demonstrate their functionalities after adding them.

Create a bag A with the items 8, 4, 5, 6, 1, 3; and create another bag, B, with the items 4, 6, 9, 2. Then show that

C = A.Union(B); C.ListAll(); // shows the items of C, it should be 8, 4, 5, 6, 1, 3, 9, 2. (the order of items can be different) C = A.Intersect(B); C.ListAll(); // shows the items of C, it should be 4, 6. (the order of items can be different)

#include

#include

#include

#include

using namespace std;

class BagDyn

{

public:

BagDyn(); // construction

bool Add(int n); // Add, true if successfully added

bool Remove(int n); // Removes an item from the bag

unsigned int getCapacity(); // return the capacity, the max number of items to be held

unsigned int getSize(); // current number of items in the bag

bool Search(int s); // search for an item

bool isEmtpy(); // Checks if the bag is empty

void ListAll(); // displays all items of the bag

private:

int * data ;

unsigned int size;

unsigned int capacity;

};

BagDyn::BagDyn() // construction

{

data = NULL;

cout << "Enter the capacity of the bag:" ;

cin >> capacity;

size = 0;

data = new int[capacity];

if (data == NULL)

{

cout << "An error occured, bag cannot be allocated" << endl;

}

else

{

cout << data;

cout << "A bag to keep " << capacity << " items is created and ready to use" << endl;

}

}

// returns the capacity, the max number of items to be held

unsigned int BagDyn::getCapacity()

{

return capacity;

}

// number of items in the bag

unsigned int BagDyn::getSize()

{

return size;

}

// search for an item

bool BagDyn::Search(int s)

{

for (int i = 0; i < size; i++) // i < size or i <= (size-1)

{

if (data[i] == s) return true;

}

return false;

}

// Checks if the bag is empty

bool BagDyn::isEmtpy()

{

if (size == 0) return true;

return false;

}

// Adds an items, true if successfully added

bool BagDyn::Add(int n)

{

if (size == capacity) return false;

for (int i = 0; i < size; i++) // i < size or i <= (size-1)

{

if (data[i] == n) return false;

}

// data[size] = n; size++;

data[size++] = n;

return true;

}

// displays all items of the bag

void BagDyn::ListAll()

{

if (size == 0) { cout << "Bag is empty" << endl; return; }

for (int i = 0; i < size; i++) // i < size or i <= (size-1)

{

cout << data[i] << ", ";

}

cout << endl;

}

// Removes an item from the bag

bool BagDyn::Remove(int n)

{

if (isEmtpy() == true) return false;

for (int i = 0; i < size; i++) // search for the item

{

if (data[i] == n)

{

data[i] = data[--size];

return true;

}

}

return false;

}

// Demonstrate the usage of the bag

int main()

{

BagDyn aBag;

aBag.ListAll(); aBag.Add(5); aBag.Add(7); aBag.Add(1);

aBag.ListAll(); aBag.Add(8); aBag.Add(17); aBag.Add(5);

aBag.ListAll();

if (aBag.Search(8) == true) cout << "8 is in the bag" << endl;

if (aBag.Search(17) == true) cout << "17 is in the bag" << endl;

if (aBag.Search(3) == true) cout << "3 is in the bag" << endl;

else cout << " 3 is not in the bag" << endl;

aBag.Remove(17); aBag.ListAll();

aBag.Remove(5); aBag.ListAll();

cout << "Size of the bag is " << aBag.getSize() << endl;

system("pause");

}