Students Instructions:

After studying this module, write the answer to the following programming assignments in a text file and submit them as an attached Word doc through the provided link in Blackboard.

The deadline for submitting this assignment is indicated on "Tools", which is located in "Calendar" in the "Blackboard" platform. You can submit your answers as many times as you need before the deadline and the last submission would be considered as your final solution. This exercise has $40$ points

$(10$ points for each part$)$

Extend bag ADT in C$++$by:

a$.$ Add the methods union, intersection, and difference to

the bag ADT. The union of two bags is a new bag

containing the combined contents of the original two

bags. The intersection of two bags is a new bag

containing the entries that occur in both of the original

two bags. The difference of two bags is a new bag

containing the entries that would be left in one bag after

removing those that also occur in the second.

b$.$ Implement union method for class ArrayBag.

c$.$ Implement intersect method for class ArrayBag.

d$.$ Imlplement difference method for class ArrayBag.