A magic square of size K is a K x K square grid filled with integers such that the sum of the integers in each row, column and diagonal of the grid is equal.For instance the following diagram shows a magic square of size $3.$ The top row has a sum of $7+3+8=18,$ the last column has a sum of $8+5+5=18$ and one of the two diagonals has a sum of $4+6+8=18.$ Every other row and column $($and the second diagonal$)$ also has a sum of $18$:Note that integers in the magic square do not have to be distinct. Also note tha t every square of size $1$ is magic. Write a function:int solution$($int $**$A$,$ int N$,$ int M$)$;that, given a matrix A consisting of N rows and M columns, returns the size of the largest magic square that can be found within this matrix.$//$ you can write to stdout for debugging purposes, e$.$g$.//$ printf$("$this is a debug message $")$;int solution$($int $**$A$,$ int N$,$ int M$)\{//$ Implement your solution here$\}$