C++ program

Write a C++ (or Java, etc.) function and test program to accomplish the following: Considering the following C++ declaration: int A[2]; // A is a set of 2 elements int B[3]={1,2,3); // B is a set of 3 elements int C[2]; // C is a set of 2 elements Requirements: a) Input numbers for A and input for C (i.e cin >> x >>y) b) Do the Cartesian product in example 1.2.7 c) Output all ordered pair and ordered triples. Cartesian Products Example: 1.2.7 (see EppDM5e_01_02.pdf) Let A = {x, y}, B = {1, 2, 3), and C = {a, b}. Write the find function for the following: 1) Find AxB 2) Find BA 3) Find AxA 4) How many elements are in A x B, B x A, and AXA 5) Find (A x B) xC 6) Define a relation R from A to B as following: Given any (x,y) means that (x-y) / 2 is an integer. Hints: #include using namespace std; struct Pair { int x; int y; vector find(int x[], int x[], int, int); int main() { int A[2]; // 1,2 int B[3] = { 1, 2, 3 }; int C[2]; // 2,3 cout > A[0] >> A[1]; cout > C[O] >> C[1]; vector axb = find(A, B, 2, 3); // Do a simple output here vector axb = find(A, B, 2, 3); // Do a simple output here string s_axb; for (int i=0; i V; // v = {(1,1) (1, 2), (1, 3), (2, 1), (2, 2), (2, 3), (1, 3), (2,2), (2,3)} return v; } Write a C++ (or Java, etc.) function and test program to accomplish the following: Considering the following C++ declaration: int A[2]; // A is a set of 2 elements int B[3]={1,2,3); // B is a set of 3 elements int C[2]; // C is a set of 2 elements Requirements: a) Input numbers for A and input for C (i.e cin >> x >>y) b) Do the Cartesian product in example 1.2.7 c) Output all ordered pair and ordered triples. Cartesian Products Example: 1.2.7 (see EppDM5e_01_02.pdf) Let A = {x, y}, B = {1, 2, 3), and C = {a, b}. Write the find function for the following: 1) Find AxB 2) Find BA 3) Find AxA 4) How many elements are in A x B, B x A, and AXA 5) Find (A x B) xC 6) Define a relation R from A to B as following: Given any (x,y) means that (x-y) / 2 is an integer. Hints: #include using namespace std; struct Pair { int x; int y; vector find(int x[], int x[], int, int); int main() { int A[2]; // 1,2 int B[3] = { 1, 2, 3 }; int C[2]; // 2,3 cout > A[0] >> A[1]; cout > C[O] >> C[1]; vector axb = find(A, B, 2, 3); // Do a simple output here vector axb = find(A, B, 2, 3); // Do a simple output here string s_axb; for (int i=0; i V; // v = {(1,1) (1, 2), (1, 3), (2, 1), (2, 2), (2, 3), (1, 3), (2,2), (2,3)} return v; }