A and b play the following game: starting with a pile of n stones, a and b take turns, each removing 1, 2, 3 or 4 stones from the pile. the player who removes the last stone loses the game. a goes first. for which values of n is this game a forced win by b? by a? (hint: try small values of n starting with n = 1. do you see a pattern?)