Write a C++ 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 Ax B 2) Find BxA 3) Find AxA 4) How many elements are in Ax B, BXA, and AXA