the game Hex, there are two players, one playing black stones and the other playing white stones. They alternate placing stones on an nxn hexagonal grid. Once stones are placed, they cannot be moved. The black player is trying to connect the top and bottom sides of the grid using a path of stones of his color. Two cells are connected on a path if they share an edge and have the same color stone. The white player is trying to connect the left and right sides of the grid. See the attached picture, in which black has won the game. Devise an efficient algorithm for determining after each move whether black or white has just won the game . Please give sudo code.