Suppose we are given an n*n square grid, some of whose squares are colored black and the rest white. Describe and analyze an algorithm to determine whether tokens can be placed on the grid so that every token is on a white square;
every row of the grid contains exactly one token; and
every column of the grid contains exactly one token.
Your input is a two dimensional array
IsWhite
[
1
..
n
,
1
..
n
]
of booleans, indicating which squares
are white. Your output is a single boolean. For ex, given the grid above as input, your
algorithm should return TRUE