There’s a N*N board, two players join the jump game. Thechess could go vertically and horizontally. If the adjacent chess is opponentplayer’s and the spot beside that is empty, then the chess could jump to thatspot. One chess could not been jumped twice. Given the position of the spot onthe board, write the program to count the longest length that chess could go.