A magic square of order n is a square array containing the integers $1,2,..,$ n$\text{'},$ each one used exactly once. The values in each row, column, and diagonals must sum to the same value. As an example, the following array is amagic square of order n $=3.$ The sum of columns, rows, and diagonals is $15\mathrm{.}438951276$Write a method called magicSquare that takes an n$-$by$-$n array and returns true if it forms a magic square, false otherwise. $($Hint: you may want to store the sum of columns and$/$or rows into temporary arrays$).$