Problem 4 [30 (10,10,10)]: My checkered path i. In the game of checkers, a game piece is allowed to move diagonally in the upwards direction only. (Let's ignore pieces jumping other pieces.) Starting at square 0:, b, c, or (1, how many paths are there to the opposite end of the board? One such path is shown. Hint: This is basically the application of the sum rule over and over again