Question 5
A rectangular grid consists of square cells. Some dominoes occupy two side-adjacent cells each; no two dominoes touch, even at a vertex. The bottom-left and top-right cells are unoccupied. A token starts at the bottom-left and may move one cell right or one cell up through side-adjacent unoccupied cells. Is it always possible to reach the top-right if the board has:
(a)101 columns and 100 rows? (2 points)
(b)$100\times100$ cells? (4 points)
(a)101 columns and 100 rows? (2 points)
(b)$100\times100$ cells? (4 points)