This is for my Discrete Struct class. Please let it be in CPP(OOP) and have three files (2 implementation and declaration files named Sets and the client file called Main)

CSIS 125 Discrete Structures Lab #1 20 pts For all Programs: To get in the habit of writing UML for the class first, then doing the program Based on Chapter 1. Create a class called Sets for positive integers that will have the following functions: addElement , will take a positive integer and add it to the set getElement, will take a position number and return the element at the position (return -1 if bad position) getSize, return the size of the set isSubset, takes a sets object (call it b) and see if the current set (call it a) is a subset of b. If so, return a Boolean true, else return a Boolean false isProper, takes a sets object (call it b) and see if the current set (call it a) is a proper subset of b. Note, use the isSubset function first then see if b has at least one more element than a printOrderedPairs, takes a sets object (call it b) and takes the current set (call it a) and prints the ordered pairs of of A XB Have main create two objects: setA and setB. Input the values into setA (end with a 0 or negative) and input the values into setB (end with 0 or negative) Print the ordered pairs using printOrderedPairs. Print if setA is a subset of setB. Then print if setA is a proper subset of setB. For CH, submit a header file, an implementation file, and a main file. Java, just the class and the main file Put in UML as comments in the header file (the class file) CSIS 125 Discrete Structures Lab #1 20 pts For all Programs: To get in the habit of writing UML for the class first, then doing the program Based on Chapter 1. Create a class called Sets for positive integers that will have the following functions: addElement , will take a positive integer and add it to the set getElement, will take a position number and return the element at the position (return -1 if bad position) getSize, return the size of the set isSubset, takes a sets object (call it b) and see if the current set (call it a) is a subset of b. If so, return a Boolean true, else return a Boolean false isProper, takes a sets object (call it b) and see if the current set (call it a) is a proper subset of b. Note, use the isSubset function first then see if b has at least one more element than a printOrderedPairs, takes a sets object (call it b) and takes the current set (call it a) and prints the ordered pairs of of A XB Have main create two objects: setA and setB. Input the values into setA (end with a 0 or negative) and input the values into setB (end with 0 or negative) Print the ordered pairs using printOrderedPairs. Print if setA is a subset of setB. Then print if setA is a proper subset of setB. For CH, submit a header file, an implementation file, and a main file. Java, just the class and the main file Put in UML as comments in the header file (the class file)