Let n be a natural number. Given a chessboard sized m×n. The sides of the small squares of chessboard are not on the perimeter of the chessboard will be colored so that each small square has exactly two sides colored. Prove that a coloring like that is possible if and only if m⋅n is even. perimeterColoringChessboardcombinatorics