Develop an object-oriented version of Percolati on (Program 2.4.5). Think carefully about the design before you begin, and be prepared to defend your design decisions.

Program 2.4.5 Percolation detection. public static boolean[] [] flow (boolean[] [] isOpen) { // Fill every site reachable from the top row. int n = isopen. length; boolean[] [] isFull = new boolean [n] [n]; for (int j = 0; j = n) return; if (i < 0 ||j > n) return; if (!isOpen[i][j]) return; if (isFull[i][j]) return; isFull[i][j] = true; flow(isOpen, isFull, i+1, j); // Down. flow(isOpen, isFull, i, j+1); // Right. flow(isOpen, isFull, i, j-1); // Left.. flow(isopen, isfull, i-1, j); // Up. } isOpen[][] isFull[][] system size (n-by-n) open sites full sites current site row, column boolean[] [] isFull, int i, int j)