Given subsets A and B of a universal set with 10 elements {0, 1, 2, 3, 4, 5, 6, 7, 8,9}.

Write a C++ program that uses bit strings to find .

Print to the screen set A, set B (be sure to print out the name of the sets), as well as the set operation results (be sure to print out the name of the operations).

The program requires that elements of subsets A and B are from user input. You can make the assumption that user input numbers are within the domain of the set {0, 1, 2, , 9} and there is no improper input.

Additional requirements and reminders: The use of STL, templates, and operator overloading is not permitted in any form. Remember: You must use a bit string when representing a set. You may not use an array of Boolean variables. The elements of subset A and subset B must from user input. You may not hardcode the two subsets in your program.

Example of bitstring representation:

given A = {1, 2, 6} and B = {2, 4, 6, 8}

the two sets should be represented as A: 00100011 and B: 10101010

AUB, AN B, andA