jaA magic square is an arrangement of numbers in such a way that every row, every column, and both diagonals have the same sum. For example this square has a such of sum of $15$:

$\left[\begin{array}{cccc}4& 9& 2& ?\\ 3& 5& 7& ?\\ 8& 1& 6& ?\\ ?& ?& ?& ?\end{array}\right]$

Write a method that will take a $2$D arary as an argument and determine whether or not it is a magic square. For example, in the Java code below array$1$ is not a magic square but array$2$ is$.$

int $[][]$ array$1=\{\{5,7,3,1\},$

$\{16,15,14,13\},$

$\{2,4,6,8\},$

$\{10,11,12,9\}\}$;

int $[][]$ array$2=\{\{6,32,3,34,35,1\},$

$\{7,11,27,28,8,30\},$

$\{19,14,16,15,23,24\},$

$\{18,20,22,21,17,13\},$

$\{25,29,10,9,26,12\},$

$\{36,5,33,4,2,31\}\}$;java