I need help with this in C++ please. [Lo Shu Magic Square]The Lo Shu Magic Square is a grid with 3 rows and 3 columns. The Lo Shu Magic Square has the following properties:1. The grid contains the numbers 1 through 9 exactly.2. The sum of each row, each column, and each diagonal all add up to the same number.In a program you can simulate a magic square using a two-dimensional array. Write a function that accepts a two-dimensional array as an argument, and determines whether the array is aLo Shu Magic Square. Test the function in a program.154+15357> 15816+ 1515151515Required function header:const int COLS = 3;void showArray(const int array[][COLS], int rows); //display 2-D array contentbool checkLoShuSquare(const int array[][COLS], int rows); // check if the 2-D is a Lo Shu Square• Hint:Find the sum of the first row. If the sum of any other row or col != the sum of the first row. return false from the checkLoShuSquare() function bool validateArray(const int array[][COLS], int rows)Write a function to validate the 2D array contains the numbers 1 through 9 exactly• Sample squares (2D array) for testing purpose:int LoShu[3][COLS] = {{4, 9, 2}, {3, 5, 7}, {8, 1, 6}};int square1[3][COLS] = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}};int square2[3][COLS] = {{1, 4, 7}, {2, 5, 8}, {3, 6, 9}};int squareTest[3][COLS] = {0}; // test the extra credit assignment• Sample output:**Test the First Square**4237816It is a Lo Shu Magic Square!**Test the Second Square**24 5TIT13689It is NOT a Lo Shu Magic Square!**Test the Last Square**458369It is NOT a Lo Shu Magic Square!**Test the invalid Square**It is NOT a 3 x 3 array contained the numbers 1~9 exactly.It is NOT a Lo Shu Magic Square!Requirements:1. Use nested for-loop to find the sum of each row and column.2. DON'T compare each sum == 15. DON'T assume the desired total is 15.3. Display the programmer info at the beginning of the output4. Include the function prototypes before the main()5. All functions definitions should be after the main()

Actually, c++ is a powerful general purpose language.#include <iostream>#include <iomanip>#include <ctime>#include <cstdlib>using namespace std;// Global constantsconst int ROWS = 3; // The number of rows in the arrayconst int COLS = 3; // The number of columns in the arrayconst int MIN = 1; // The value of the smallest numberconst int MAX = 9; // The value of the largest number// Function prototypesvoid showResult(int[][COLS]);void showArray(int[][COLS]);bool isMagicSquare(int[][COLS]);bool checkRange(int[][COLS]);bool checkUnique(int[][COLS]);bool checkRowSum(int[][COLS]);bool checkColSum(int[][COLS]);bool checkDiagSum(int[][COLS]);int main(){ int magicArray[ROWS][COLS];char ch; while(true){for(int i=0;i<ROWS;i++){for(int j=0;j<COLS;j++){cout<<"Enter the number for row "<<(i)<<" and column "<<(j)<<" :";cin>>magicArray[i][j];}}for(int i=0;i<ROWS;i++){for(int j=0;j<COLS;j++){cout<<magicArray[i][j]<<" ";}cout<<endl;} // Test the magic array and display the result.showResult(magicArray);cout<<"\n\nDo you want to try again :";cin>>ch; if(ch=='y'||ch=='Y'){ continue; }else{break;} } return 0;}// ********************************************************// The showResult function accepts a two-dimensional int *// array as an argument, tests to determine if it is a *// Lo Shu Magic Square and displays the result. *// ********************************************************void showResult(int values[][COLS]){// Determine if the array is a Lo Shu Magic Square.if (isMagicSquare(values)) {// If so, display a message indicating that the// array is a magic square.cout << "This is a Lo Shu magic square.\n\n";}else {// If not, display a message indicating that the// array is not a magic square.cout << "This is not a Lo Shu magic square.\n\n";}}// ********************************************************// The showArray function accepts a two-dimensional int *// array as an argument and displays its contents. *// ********************************************************void showArray(int values[][COLS]){// Step through all the values in the array.for (int row = 0; row < ROWS; row++) {for (int col = 0; col < COLS; col++) {// Display the values in this row.cout << values[row][col] << " ";}// End the line, so we can display the next row.cout << endl;}}// ********************************************************// The isMagicSquare function accepts a two-dimensional *// int array as an argument, and returns true if the *// array meets all the requirements of a magic square. *// Otherwise, it returns false. *// ********************************************************bool isMagicSquare(int values[][COLS]){// Initialize the status to false.bool status = false;// Call the functions to check the array.bool isInRange = checkRange(values);bool isUnique = checkUnique(values);bool isEqualRows = checkRowSum(values);bool isEqualCols = checkColSum(values);bool isEqualDiag = checkDiagSum(values);// Determine if the array meets all the requirments.if (isInRange && isUnique && isEqualRows && isEqualCols && isEqualDiag) {// If so, set the status to true.status = true;}// Return the status.return status;}// ********************************************************// The checkRange function accepts a two-dimensional int *// array as an argument, and returns true if the values *// are within the specified range. Otherwise, it returns *// false. *// ********************************************************bool checkRange(int values[][COLS]){// Initialize status to true.bool status = true;// Step through all the values in the array.for (int row = 0; row < ROWS; row++) {for (int col = 0; col < COLS; col++) {// Determine if the value is out of range.if (values[row][col] < MIN || values[row][col] > MAX) {// If so, set status to false.status = false;}}}// Return the status.return status;}// ********************************************************// The checkUnique function accepts a two-dimensional int *// array as an argument, and returns true if the values *// in the array are unique. Otherwise, it returns false. *// ********************************************************bool checkUnique(int values[][COLS]){int count;int num=1;bool status=true;for (int i = 0; i < ROWS; i++){count = 0;for (int j = 0; j < COLS; j++){if (values[i][j] == num)count++;}if (count > 1)status=false;num++;}// Return the status.return status;}// ********************************************************// The checkRowSum function accepts a two-dimensional *// int array as an argument, and returns true if the sum *// of the values in each of the array's rows are equal. *// Otherwise, it returns false. *// ********************************************************bool checkRowSum(int values[][COLS]){// Initialize status to true.bool status = true;// Calculate the sum of the values in the first row.int sumRowA = values[0][0] + values[0][1] + values[0][2];// Calculate the sum of the values in the second row.int sumRowB = values[1][0] + values[1][1] + values[1][2];// Calculate the sum of the values in the third row.int sumRowC = values[2][0] + values[2][1] + values[2][2];// Determine if the sum of the columns is not equal.if ((sumRowA != sumRowB) || (sumRowA != sumRowC) || (sumRowB != sumRowC)) {// If so, set status to false.status = false;}// Return the status.return status;}// ********************************************************// The checkColSum function accepts a two-dimensional *// int array as an argument, and returns true if the sum *// of the values in each of the array's columns are *// equal. Otherwise, it returns false. *// ********************************************************bool checkColSum(int values[][COLS]){// Initialize status to true.bool status = true;// Calculate the sum of the values in the first column.int sumColA = values[0][0] + values[1][0] + values[2][0];// Calculate the sum of the values in the second column.int sumColB = values[0][1] + values[1][1] + values[2][1];// Calculate the sum of the values in the third column.int sumColC = values[0][2] + values[1][2] + values[2][2];// Determine if the sum of the columns is not equal.if ((sumColA != sumColB) || (sumColA != sumColC) || (sumColB != sumColC)) {// If so, set status to false.status = false;}// Return the status.return status;}// ********************************************************// The checkDiagSum function accepts a two-dimensional *// int array as an argument, and returns true if the sum *// of the values in each of the array's diagonals are *// equal. Otherwise, it returns false. *// ********************************************************bool checkDiagSum(int values[][COLS]){// Initialize status to true;bool status = true;// Calculate the sum of the values in the first diagonal.int sumDiagA = values[0][0] + values[1][1] + values[2][2];// Calculate the sum of the values in the second diagonal.int sumDiagB = values[2][0] + values[1][1] + values[0][2];// Determine if the sum of the diagonals is not equal.if (sumDiagA != sumDiagB) {// If so, set status to false.status = false;} // Return the status.return status;}Output: Enter the number for row 0 and column 0: 1 Enter the number for row 0 and column 1: 3 Enter the number for row 0 and column 2: 2 Enter the number for row 1 and column 0: 5 Enter the number for row 1 and column 1: 4 Enter the number for row 1 and column 2: 9 Enter the number for row 2 and column 0: 6 Enter the number for row 2 and column 1: 7 Enter the number for row 2 and column 2: 8 1 3 2 5 4 9 6 7 8 This is not a Lo Shu magic square. Do you want to try again : y Enter the number for row 0 and column 0: 10 Enter the number for row 0 and column 1: 2 Enter the number for row 0 and column 2: 3 Enter the number for row 1 and column 0: 4 Enter the number for row 1 and column 1: 15 Enter the number for row 1 and column 2: 6 Enter the number for row 2 and column 0: 7 Enter the number for row 2 and column 1: 8 Enter the number for row 2 and column 2: -8 10 2 3 4 15 6 7 8 -8 This is not a Lo shu magic square. Do you want to try again: y Enter the number for row 0 and column 0: 4 Enter the number for row 0 and column 1: 9 Enter the number for row 0 and column 2: 2 Enter the number for row 1 and column 0: 3 Enter the number for row 1 and column 1: 5 Enter the number for row 1 and column 2: 7 Enter the number for row 2 and column 0: 8 Enter the number for row 2 and column 1: 1 Enter the number for row 2 and column 2: 6 4 9 2 3 5 7 8 1 6 This is a Lo shu magic square. Do you want to try again: n -------------------------------------------- Process exited after 54.71 seconds with return value 0 Press any key to continue........

Engineering

Computer Science

[Lo Shu Magic Square] The Lo Shu Magic Square is a grid with 3 rows and 3 columns. The Lo Shu Magic Square has the following properties: 1. The grid contains the numbers 1 through 9 exactly. 2. The sum of each row, each column, and each diagonal all add up to the same number. In a program you can simulate a magic square using a two-dimensional array. Write a function that accepts a two-dimensional array as an argument, and determines whetl Lo Shu Magic Square. Test the function in a program. 15 4 9 2 15 3 7 > 15 8 1 6 + 15 15 15 15 15