2. Assume a set (x: x is an even integer that0 and 32). Print out the number of its subsets. Moreover, print out the number of subsets that contain (2, 10, 24). You should let your C++ program to do the actual calculation. NOTE: For Problem 2, it is an application of product rule. Sample output: options compilation execution Problem1 Please input an integer n: 6 double factorial is 48 Please input an integer n: 7 double factorial is 105 Problem2 The set contains 2468 10 12 14 16 18 20 22 24 26 28 30 32 The number of subsets is:XXX The number of subsets containing (2, 10, 24) is X0OX