Lets say u have 2D array (matrix) of integer with size N*N with values of 0 (N> 2).Elements of this matrix are inserted with another value, and the middle of this matrix is always have other value than 0. Make a program in C (explain each steps if possible) and flowchart (for better understanding) to get where is the nearest element with same value as matrix's centroid. If more than 1 position exists near the centroid, print all the nearest elements. If no nearest element exists that has the same value with the centroid, print: "No nearest element exists". The assumption is that position 0,0 start from top leftmost matrix.

input

5

0 0 2 0 0

0 1 0 0 0

0 0 1 0 5

0 0 0 0 0

0 0 0 0 1

(centroid at 2.2)

output:

Nearest same element is at: 1,1

input

5

0 0 2 0 0

0 1 0 0 0

0 1 1 1 3

0 0 0 0 0

0 0 0 0 9

(centroid at 2.2)

output:

Nearest same element is at: 2,3 and 2,1