Please answer in C++ only using the header <iostream> and using namespace std; 4.) Universal Set: [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20]Set A: [1,2,3,5,8,13]Set B:[1,3,5,7,9,11,13,15,17,19]Set C: [1,2,3,5,7,11,13,17,19]Please print out: ((A Union B) Intersect C)

The C++ code is given below with output screenshot#include <iostream> using namespace std; int main() { // Declare and initialize sets int universalSet[] = {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20}; int setA[] = {1,2,3,5,8,13}; int setB[] = {1,3,5,7,9,11,13,15,17,19}; int setC[] = {1,2,3,5,7,11,13,17,19}; // Initialize result set int resultSet[20]; int resultSetSize = 0; // Find union of set A and set B for (int i = 0; i < 6; i++) { resultSet[resultSetSize] = setA[i]; resultSetSize++; } for (int i = 0; i < 10; i++) { bool found = false; for (int j = 0; j < 6; j++) { if (setB[i] == setA[j]) { found = true; } } if (!found) { resultSet[resultSetSize] = setB[i]; resultSetSize++; } } // Find intersection of result set and set C for (int i = 0; i < resultSetSize; i++) { bool found = false; for (int j = 0; j < 9; j++) { if (resultSet[i] == setC[j]) { found = true; } } if (!found) { // Remove element from result set if not in set C for (int k = i; k < resultSetSize - 1; k++) { resultSet[k] = resultSet[k + 1]; } resultSetSize--; i--; } } // Print result set cout << "((A Union B) Intersect C) = {"; for (int i = 0; i < resultSetSize; i++) { cout << resultSet[i]; if (i != resultSetSize - 1) { cout << ","; } } cout << "}" << endl; return 0;}