In a 2D array, a local maximum is defined as before, but the neighbors are both vertices and horizontal. So the neighbors of A[i][j] are A[i 1][j], A[i + 1][j], A[i][j 1], A[i][j + 1] (whenever they exist). Find a local maximum.