Using Boolean-Array representation of sets,
define a set class which includes the following operations:
CreateSet() : Set produce a set S containing 0 objects,empty set.
Insert(Element): If element is already in the set,
do nothing; otherwise add it to the set.
Delete(Element): If element is not a member of the set,do nothing; otherwise remove it from the set.
Union(Set): Set All elements of two Sets, no duplications.
Intersection(Set): Set All elements common to both sets.
Difference(Set): Set All elements of the first set except the elements that are in common with the second set.
Empty(Set) : Boolean True, if the set is empty; False, otherwise.
Member(Element): Boolean True, if Element is a member of the set; False, otherwise.
Subset(Set): Boolean True, if first set is a subset of second set. All elements of the first set are also elements of the second set.
Index (Element): Index return the index of an element of the universe.
Display(): Display the set.
Define an Universe and include it in the set class.
Instantiate several different examples of sets and
operate on them.
Display the set before and after each operation.
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.