i am working on a percolation code and i need help.

percolation:

percolation stats:

import dsa.WeightedQuickUnionUF; import stdlib.In; import stdlib.Stdout // Models an N-by-N percolation system. public class Percolation { int N; / xn matrix boolean[][] open; // THE matrix int siteOpen; private WeightedQuickUnionUF uf; // union find data structured int source; int sink; // Creates an N-by-N grid, with all sites blocked. public Percolation(int N) { this.N=N; open = new boolean(this.N][this.N]; uf = new WeightedQuickUnionUF(this.N * this.N +2); sink=this.N * this. N +1; source = 0; D> A if(this.N this.N -1 ) { | throw new IndexOutOfBoundsException(); } if(i this.N -1 ){ A if(i this.N -1 ){ throw new IndexOutOfBoundsException(); } if(!isOpen(i,j)) { open[i][j]= true; siteOpen +=1; } if(i + 1 = 0 && i = 0 && j A if(this.N this.N -1 ) { | throw new IndexOutOfBoundsException(); } if(i this.N -1 ){ A if(i this.N -1 ){ throw new IndexOutOfBoundsException(); } if(!isOpen(i,j)) { open[i][j]= true; siteOpen +=1; } if(i + 1 = 0 && i = 0 && j