help pls thx

a) [4 points] Consider a game in which players alternate removing chips from a pile, where Player I can remove 1 or 3 chips and Player II can remove 2 or 4 chips. Assume normal play, meaning that the rst player who cannot make a legal move loses. If the pile starts with 2021 chips and Player II plays rst, which player has the winning strategy? (Hint: Recall that in a progressively bounded impartial combinatorial game, a state is winning if and only it admits some legal move leading to a losing state. You can use without proof the following variant of this fact for progressively bounded partisan combinatorial games: A state is winning for a particular player if and only it admits some legal move leading to a losing state for the other player.)